Base | Representation |
---|---|
bin | 1001000111000001110101… |
… | …00110010110011010001011 |
3 | 2121221002221001020011122201 |
4 | 10203200322212112122023 |
5 | 10111203442403202311 |
6 | 110334522235501031 |
7 | 4135213146363412 |
oct | 443407246263213 |
9 | 77832831204581 |
10 | 20032710600331 |
11 | 6423908978230 |
12 | 22b65822b7777 |
13 | b240cc104450 |
14 | 4d3834698479 |
15 | 24b16b93a9c1 |
hex | 12383a99668b |
20032710600331 has 8 divisors (see below), whose sum is σ = 23534932733424. Its totient is φ = 16810666237920.
The previous prime is 20032710600323. The next prime is 20032710600359. The reversal of 20032710600331 is 13300601723002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20032710600331 - 23 = 20032710600323 is a prime.
It is a super-2 number, since 2×200327106003312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20032710600331.
It is not an unprimeable number, because it can be changed into a prime (20032710600391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70044442516 + ... + 70044442801.
It is an arithmetic number, because the mean of its divisors is an integer number (2941866591678).
Almost surely, 220032710600331 is an apocalyptic number.
20032710600331 is a deficient number, since it is larger than the sum of its proper divisors (3502222133093).
20032710600331 is a wasteful number, since it uses less digits than its factorization.
20032710600331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140088885341.
The product of its (nonzero) digits is 4536, while the sum is 28.
The spelling of 20032710600331 in words is "twenty trillion, thirty-two billion, seven hundred ten million, six hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •