Base | Representation |
---|---|
bin | 1001001100011110110000… |
… | …1101111011100010011001 |
3 | 1022210111201202101100102012 |
4 | 2103013230031323202121 |
5 | 2311120310401402301 |
6 | 33300251331315305 |
7 | 2062265514426440 |
oct | 223075415734231 |
9 | 38714652340365 |
10 | 10110021122201 |
11 | 32486aa3a05a0 |
12 | 117348174bb35 |
13 | 5844a8b3c570 |
14 | 26d48304dd57 |
15 | 127eb8d0debb |
hex | 931ec37b899 |
10110021122201 has 32 divisors (see below), whose sum is σ = 13582295371008. Its totient is φ = 7267656867840.
The previous prime is 10110021122153. The next prime is 10110021122219. The reversal of 10110021122201 is 10222112001101.
It is a cyclic number.
It is not a de Polignac number, because 10110021122201 - 26 = 10110021122137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10110021121201) 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 31 ways as a sum of consecutive naturals, for example, 1277120 + ... + 4674513.
It is an arithmetic number, because the mean of its divisors is an integer number (424446730344).
Almost surely, 210110021122201 is an apocalyptic number.
10110021122201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10110021122201 is a deficient number, since it is larger than the sum of its proper divisors (3472274248807).
10110021122201 is a wasteful number, since it uses less digits than its factorization.
10110021122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5953361.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10110021122201 its reverse (10222112001101), we get a palindrome (20332133123302).
The spelling of 10110021122201 in words is "ten trillion, one hundred ten billion, twenty-one million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •