Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …1110010010111100101011 |
3 | 1100010022200200211012022212 |
4 | 2110131203032102330223 |
5 | 2314123112234120021 |
6 | 33410455334235335 |
7 | 2102041216222244 |
oct | 224354316227453 |
9 | 40108620735285 |
10 | 10202212020011 |
11 | 3283808794630 |
12 | 11893101b5b4b |
13 | 5900ab82717b |
14 | 273b0acd9ccb |
15 | 12a5b26aa85b |
hex | 94763392f2b |
10202212020011 has 8 divisors (see below), whose sum is σ = 11715458779200. Its totient is φ = 8786594084040.
The previous prime is 10202212020001. The next prime is 10202212020029. The reversal of 10202212020011 is 11002021220201.
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 10202212020011 - 26 = 10202212019947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10202212020001) 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 7 ways as a sum of consecutive naturals, for example, 24407205581 + ... + 24407205998.
It is an arithmetic number, because the mean of its divisors is an integer number (1464432347400).
Almost surely, 210202212020011 is an apocalyptic number.
10202212020011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10202212020011 is a deficient number, since it is larger than the sum of its proper divisors (1513246759189).
10202212020011 is a wasteful number, since it uses less digits than its factorization.
10202212020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48814411609.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10202212020011 its reverse (11002021220201), we get a palindrome (21204233240212).
The spelling of 10202212020011 in words is "ten trillion, two hundred two billion, two hundred twelve million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •