Base | Representation |
---|---|
bin | 1001010010111001101101… |
… | …0000100010111110100111 |
3 | 1100012001110111202201101210 |
4 | 2110232123100202332213 |
5 | 2314422214443100424 |
6 | 33423053344322503 |
7 | 2103252232435551 |
oct | 224563320427647 |
9 | 40161414681353 |
10 | 10220332003239 |
11 | 3290466a77186 |
12 | 1190928613433 |
13 | 591a08876b37 |
14 | 27494963a4d1 |
15 | 12acc3364729 |
hex | 94b9b422fa7 |
10220332003239 has 32 divisors (see below), whose sum is σ = 14141419200000. Its totient is φ = 6557910274944.
The previous prime is 10220332003237. The next prime is 10220332003241. The reversal of 10220332003239 is 93230023302201.
It is an interprime number because it is at equal distance from previous prime (10220332003237) and next prime (10220332003241).
It is not a de Polignac number, because 10220332003239 - 21 = 10220332003237 is a prime.
It is a super-2 number, since 2×102203320032392 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220332003237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37938982 + ... + 38207420.
It is an arithmetic number, because the mean of its divisors is an integer number (441919350000).
Almost surely, 210220332003239 is an apocalyptic number.
10220332003239 is a deficient number, since it is larger than the sum of its proper divisors (3921087196761).
10220332003239 is a wasteful number, since it uses less digits than its factorization.
10220332003239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269847.
The product of its (nonzero) digits is 11664, while the sum is 30.
The spelling of 10220332003239 in words is "ten trillion, two hundred twenty billion, three hundred thirty-two million, three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •