number.wiki
Live analysis

31,590,690

31,590,690 is a composite number, even.

This number doesn't have a permanent NumberWiki page yet — what you see below is computed live. Pages get added to the permanent index when they're notable (years, primes, curated, etc.).

31,590,690 (thirty-one million five hundred ninety thousand six hundred ninety) is an even 8-digit number. It is a composite number with 32 divisors, and factors as 2 × 3 × 5 × 389 × 2,707. Its proper divisors sum to 44,449,950, more than the number itself, making it an abundant number. Written other ways, in hexadecimal, 0x1E20922.

Abundant Number Arithmetic Number Cube-Free Gapful Number Odious Number Semiperfect Number Squarefree

Interestingness

Properties

Parity
Even
Digit count
8
Digit sum
33
Digit product
0
Digital root
6
Palindrome
No
Bit width
25 bits
Reversed
9,609,513
Square (n²)
997,971,694,676,100
Divisor count
32
σ(n) — sum of divisors
76,040,640
φ(n) — Euler's totient
8,399,424
Sum of prime factors
3,106

Primality

Prime factorization: 2 × 3 × 5 × 389 × 2707

Nearest primes: 31,590,683 (−7) · 31,590,731 (+41)

Divisors & multiples

All divisors (32)
1 · 2 · 3 · 5 · 6 · 10 · 15 · 30 · 389 · 778 · 1167 · 1945 · 2334 · 2707 · 3890 · 5414 · 5835 · 8121 · 11670 · 13535 · 16242 · 27070 · 40605 · 81210 · 1053023 · 2106046 · 3159069 · 5265115 · 6318138 · 10530230 · 15795345 (half) · 31590690
Aliquot sum (sum of proper divisors): 44,449,950
Factor pairs (a × b = 31,590,690)
1 × 31590690
2 × 15795345
3 × 10530230
5 × 6318138
6 × 5265115
10 × 3159069
15 × 2106046
30 × 1053023
389 × 81210
778 × 40605
1167 × 27070
1945 × 16242
2334 × 13535
2707 × 11670
3890 × 8121
5414 × 5835
First multiples
31,590,690 · 63,181,380 (double) · 94,772,070 · 126,362,760 · 157,953,450 · 189,544,140 · 221,134,830 · 252,725,520 · 284,316,210 · 315,906,900

Sums & aliquot sequence

As consecutive integers: 10,530,229 + 10,530,230 + 10,530,231 7,897,671 + 7,897,672 + 7,897,673 + 7,897,674 6,318,136 + 6,318,137 + 6,318,138 + 6,318,139 + 6,318,140 2,632,552 + 2,632,553 + … + 2,632,563
Aliquot sequence: 31,590,690 44,449,950 68,779,410 120,961,902 139,405,362 139,405,374 178,109,274 228,997,734 294,425,754 420,468,582 471,197,562 556,869,990 781,601,946 832,028,262 960,032,778 1,029,456,822 1,157,730,378 — unresolved within range

Continued fraction of √n

√31,590,690 = [5620; (1, 1, 3, 1, 2, 3, 2, 5, 6, 1, 5, 6, 1, 3, 1, 3, 7, 1, 2, 1, 2, 1, 1, 1, …)]

Representations

In words
thirty-one million five hundred ninety thousand six hundred ninety
Ordinal
31590690th
Binary
1111000100000100100100010
Octal
170404442
Hexadecimal
0x1E20922
Base64
AeIJIg==
One's complement
4,263,376,605 (32-bit)
Scientific notation
3.159069 × 10⁷
As a duration
31,590,690 s = 1 year, 15 hours, 11 minutes, 30 seconds
In other bases
ternary (3) 2012102222021120
quaternary (4) 1320200210202
quinary (5) 31041400230
senary (6) 3045033110
septenary (7) 532342065
nonary (9) 65388246
undecimal (11) 1691760a
duodecimal (12) a6b5796
tridecimal (13) 6711021
tetradecimal (14) 42a48dc
pentadecimal (15) 2b90310

As an angle

31,590,690° = 87,751 × 360° + 330°
330° ≈ 5.76 rad
Compass bearing: NNW (north-northwest)

Historical numeral systems

Chinese
三千一百五十九萬零六百九十
Chinese (financial)
參仟壹佰伍拾玖萬零陸佰玖拾
In other modern scripts
Eastern Arabic ٣١٥٩٠٦٩٠ Devanagari ३१५९०६९० Bengali ৩১৫৯০৬৯০ Tamil ௩௧௫௯௦௬௯௦ Thai ๓๑๕๙๐๖๙๐ Tibetan ༣༡༥༩༠༦༩༠ Khmer ៣១៥៩០៦៩០ Lao ໓໑໕໙໐໖໙໐ Burmese ၃၁၅၉၀၆၉၀

Also seen as

Goldbach decomposition

Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 31590690, here are decompositions:

  • 7 + 31590683 = 31590690
  • 23 + 31590667 = 31590690
  • 31 + 31590659 = 31590690
  • 41 + 31590649 = 31590690
  • 59 + 31590631 = 31590690
  • 73 + 31590617 = 31590690
  • 97 + 31590593 = 31590690
  • 101 + 31590589 = 31590690

Showing the first eight; more decompositions exist.

IPv4 address

As an unsigned 32-bit integer, this is the IPv4 address 1.226.9.34.

Address
1.226.9.34
Class
public
IPv4-mapped IPv6
::ffff:1.226.9.34

Public, routable address (assignable to a host on the internet).