Base | Representation |
---|---|
bin | 1001000110001001011000… |
… | …0110000000011010000101 |
3 | 1022102002211222001022001111 |
4 | 2101202112012000122011 |
5 | 2302324430204201041 |
6 | 33134253324325021 |
7 | 2051364052353550 |
oct | 221422606003205 |
9 | 38362758038044 |
10 | 10001202022021 |
11 | 32065388a0a51 |
12 | 11563723a3771 |
13 | 5771561aa162 |
14 | 2680bca27697 |
15 | 12524a72c981 |
hex | 91896180685 |
10001202022021 has 8 divisors (see below), whose sum is σ = 11468955222144. Its totient is φ = 8543201335440.
The previous prime is 10001202022013. The next prime is 10001202022039. The reversal of 10001202022021 is 12022020210001.
It is a happy number.
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 10001202022021 - 23 = 10001202022013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001202021992 and 10001202022010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001203022021) 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, 2438126185 + ... + 2438130286.
It is an arithmetic number, because the mean of its divisors is an integer number (1433619402768).
Almost surely, 210001202022021 is an apocalyptic number.
It is an amenable number.
10001202022021 is a deficient number, since it is larger than the sum of its proper divisors (1467753200123).
10001202022021 is an equidigital number, since it uses as much as digits as its factorization.
10001202022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4876256771.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10001202022021 its reverse (12022020210001), we get a palindrome (22023222232022).
The spelling of 10001202022021 in words is "ten trillion, one billion, two hundred two million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •