Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …1000011100010011011001 |
3 | 1022210121022111221102021021 |
4 | 2103020213320130103121 |
5 | 2311124333130402301 |
6 | 33300534530242441 |
7 | 2062332360664000 |
oct | 223104770342331 |
9 | 38717274842237 |
10 | 10111022122201 |
11 | 3249073437720 |
12 | 1173700a26421 |
13 | 584608339960 |
14 | 26d539d7bc37 |
15 | 128026b3b8a1 |
hex | 93227e1c4d9 |
10111022122201 has 192 divisors, whose sum is σ = 14535834163200. Its totient is φ = 6930236396160.
The previous prime is 10111022122177. The next prime is 10111022122217. The reversal of 10111022122201 is 10222122011101.
It is not a de Polignac number, because 10111022122201 - 25 = 10111022122169 is a prime.
It is a super-3 number, since 3×101110221222013 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10111022122241) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 9003581026 + ... + 9003582148.
It is an arithmetic number, because the mean of its divisors is an integer number (75707469600).
Almost surely, 210111022122201 is an apocalyptic number.
10111022122201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10111022122201 is a deficient number, since it is larger than the sum of its proper divisors (4424812040999).
10111022122201 is a wasteful number, since it uses less digits than its factorization.
10111022122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561 (or 1524 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10111022122201 its reverse (10222122011101), we get a palindrome (20333144133302).
The spelling of 10111022122201 in words is "ten trillion, one hundred eleven billion, twenty-two million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •