Base | Representation |
---|---|
bin | 1001000110001001011100… |
… | …1010101010101100100101 |
3 | 1022102002220012220202001102 |
4 | 2101202113022222230211 |
5 | 2302324444311133104 |
6 | 33134255210205445 |
7 | 2051364361350026 |
oct | 221422712525445 |
9 | 38362805822042 |
10 | 10001220021029 |
11 | 3206547a74966 |
12 | 1156378423885 |
13 | 577159b3c863 |
14 | 2680c1190c4d |
15 | 12524c0d5a1e |
hex | 918972aab25 |
10001220021029 has 2 divisors, whose sum is σ = 10001220021030. Its totient is φ = 10001220021028.
The previous prime is 10001220020999. The next prime is 10001220021061. The reversal of 10001220021029 is 92012002210001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9746896488004 + 254323533025 = 3122002^2 + 504305^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001220021029 - 212 = 10001220016933 is a prime.
It is a super-2 number, since 2×100012200210292 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10001220021029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001240021029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000610010514 + 5000610010515.
It is an arithmetic number, because the mean of its divisors is an integer number (5000610010515).
Almost surely, 210001220021029 is an apocalyptic number.
It is an amenable number.
10001220021029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001220021029 is an equidigital number, since it uses as much as digits as its factorization.
10001220021029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 10001220021029 in words is "ten trillion, one billion, two hundred twenty million, twenty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •