number.wiki
Live analysis

31,596,968

31,596,968 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,596,968 (thirty-one million five hundred ninety-six thousand nine hundred sixty-eight) is an even 8-digit number. It is a composite number with 16 divisors, and factors as 2³ × 13 × 303,817. Its proper divisors sum to 32,204,812, more than the number itself, making it an abundant number. Written other ways, in hexadecimal, 0x1E221A8.

Abundant Number Evil Number Semiperfect Number

Interestingness

Properties

Parity
Even
Digit count
8
Digit sum
47
Digit product
349,920
Digital root
2
Palindrome
No
Bit width
25 bits
Reversed
86,969,513
Square (n²)
998,368,386,793,024
Divisor count
16
σ(n) — sum of divisors
63,801,780
φ(n) — Euler's totient
14,583,168
Sum of prime factors
303,836

Primality

Prime factorization: 2 3 × 13 × 303817

Nearest primes: 31,596,949 (−19) · 31,596,977 (+9)

Divisors & multiples

All divisors (16)
1 · 2 · 4 · 8 · 13 · 26 · 52 · 104 · 303817 · 607634 · 1215268 · 2430536 · 3949621 · 7899242 · 15798484 (half) · 31596968
Aliquot sum (sum of proper divisors): 32,204,812
Factor pairs (a × b = 31,596,968)
1 × 31596968
2 × 15798484
4 × 7899242
8 × 3949621
13 × 2430536
26 × 1215268
52 × 607634
104 × 303817
First multiples
31,596,968 · 63,193,936 (double) · 94,790,904 · 126,387,872 · 157,984,840 · 189,581,808 · 221,178,776 · 252,775,744 · 284,372,712 · 315,969,680

Sums & aliquot sequence

As a sum of two squares: 662² + 5,582² = 2,758² + 4,898²
As consecutive integers: 2,430,530 + 2,430,531 + … + 2,430,542 1,974,803 + 1,974,804 + … + 1,974,818 151,805 + 151,806 + … + 152,012
Aliquot sequence: 31,596,968 32,204,812 24,153,616 23,733,696 48,036,544 47,286,100 55,637,000 85,886,200 113,799,680 159,058,972 119,416,764 167,451,972 247,182,780 542,323,140 977,219,388 1,530,807,588 2,341,989,340 — unresolved within range

Continued fraction of √n

√31,596,968 = [5621; (8, 2, 8, 2, 1, 2, 38, 1, 3, 1, 23, 51, 1, 3, 3, 1, 3, 2, 12, 1, 1, 23, 3, 2, …)]

Representations

In words
thirty-one million five hundred ninety-six thousand nine hundred sixty-eight
Ordinal
31596968th
Binary
1111000100010000110101000
Octal
170420650
Hexadecimal
0x1E221A8
Base64
AeIhqA==
One's complement
4,263,370,327 (32-bit)
Scientific notation
3.1596968 × 10⁷
As a duration
31,596,968 s = 1 year, 16 hours, 56 minutes, 8 seconds
In other bases
ternary (3) 2012110021220002
quaternary (4) 1320202012220
quinary (5) 31042100333
senary (6) 3045122132
septenary (7) 532366304
nonary (9) 65407802
undecimal (11) 169212a7
duodecimal (12) a6b9348
tridecimal (13) 6713b40
tetradecimal (14) 42a6d04
pentadecimal (15) 2b920e8

As an angle

31,596,968° = 87,769 × 360° + 128°
128° ≈ 2.234 rad
Compass bearing: SE (southeast)

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 31596968, here are decompositions:

  • 19 + 31596949 = 31596968
  • 61 + 31596907 = 31596968
  • 79 + 31596889 = 31596968
  • 199 + 31596769 = 31596968
  • 211 + 31596757 = 31596968
  • 307 + 31596661 = 31596968
  • 331 + 31596637 = 31596968
  • 397 + 31596571 = 31596968

Showing the first eight; more decompositions exist.

IPv4 address

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

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

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

Position in π

The digit sequence 31596968 first appears in π at position 445,889 of the decimal expansion (the 445,889ordinal-suffix:th digit after the integer 3).

Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.