Base | Representation |
---|---|
bin | 1001010011000000101010… |
… | …1010001101000001001011 |
3 | 1100012020021202121120222110 |
4 | 2110300022222031001023 |
5 | 2314440031424000021 |
6 | 33424003031353403 |
7 | 2103346445601000 |
oct | 224601252150113 |
9 | 40166252546873 |
10 | 10222201000011 |
11 | 3291235a77110 |
12 | 119116a522863 |
13 | 591c45b43ba0 |
14 | 274a859538a7 |
15 | 12ad8249b476 |
hex | 94c0aa8d04b |
10222201000011 has 256 divisors, whose sum is σ = 19308280320000. Its totient is φ = 4736890368000.
The previous prime is 10222201000001. The next prime is 10222201000013. The reversal of 10222201000011 is 11000010222201.
It is not a de Polignac number, because 10222201000011 - 222 = 10222196805707 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10222201000013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 811215111 + ... + 811227711.
It is an arithmetic number, because the mean of its divisors is an integer number (75422970000).
Almost surely, 210222201000011 is an apocalyptic number.
10222201000011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10222201000011 is a deficient number, since it is larger than the sum of its proper divisors (9086079319989).
10222201000011 is a wasteful number, since it uses less digits than its factorization.
10222201000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12835 (or 12821 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10222201000011 its reverse (11000010222201), we get a palindrome (21222211222212).
The spelling of 10222201000011 in words is "ten trillion, two hundred twenty-two billion, two hundred one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.803 sec. • engine limits •