Base | Representation |
---|---|
bin | 1001001101000100010011… |
… | …1110101001010000110001 |
3 | 1022211110202011222200001210 |
4 | 2103101010332221100301 |
5 | 2311301431124101001 |
6 | 33305035421350333 |
7 | 2063103342365160 |
oct | 223210476512061 |
9 | 38743664880053 |
10 | 10120100222001 |
11 | 3251a01821440 |
12 | 11754151083a9 |
13 | 585424033443 |
14 | 26db5b8c33d7 |
15 | 1283a8ae3dd6 |
hex | 93444fa9431 |
10120100222001 has 32 divisors (see below), whose sum is σ = 17365701943296. Its totient is φ = 5087607984000.
The previous prime is 10120100221981. The next prime is 10120100222033. The reversal of 10120100222001 is 10022200102101.
It is not a de Polignac number, because 10120100222001 - 214 = 10120100205617 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10120100223001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 706605060 + ... + 706619381.
It is an arithmetic number, because the mean of its divisors is an integer number (542678185728).
Almost surely, 210120100222001 is an apocalyptic number.
10120100222001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10120100222001 is a deficient number, since it is larger than the sum of its proper divisors (7245601721295).
10120100222001 is a wasteful number, since it uses less digits than its factorization.
10120100222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413224493.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10120100222001 its reverse (10022200102101), we get a palindrome (20142300324102).
The spelling of 10120100222001 in words is "ten trillion, one hundred twenty billion, one hundred million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •