Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0011101111101111001 |
3 | 100122222112111212210110 |
4 | 1132022220131331321 |
5 | 3124033142041441 |
6 | 114241020334533 |
7 | 10206413525664 |
oct | 1361250357571 |
9 | 318875455713 |
10 | 101110112121 |
11 | 39976027837 |
12 | 177196a4449 |
13 | 96c47c1015 |
14 | 4c726726db |
15 | 296b91bb16 |
hex | 178aa1df79 |
101110112121 has 16 divisors (see below), whose sum is σ = 139339006784. Its totient is φ = 65167187904.
The previous prime is 101110112111. The next prime is 101110112149. The reversal of 101110112121 is 121211011101.
It is not a de Polignac number, because 101110112121 - 26 = 101110112057 is a prime.
It is a super-2 number, since 2×1011101121212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101110112097 and 101110112106.
It is not an unprimeable number, because it can be changed into a prime (101110112111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2883535 + ... + 2918388.
It is an arithmetic number, because the mean of its divisors is an integer number (8708687924).
Almost surely, 2101110112121 is an apocalyptic number.
It is an amenable number.
101110112121 is a deficient number, since it is larger than the sum of its proper divisors (38228894663).
101110112121 is a wasteful number, since it uses less digits than its factorization.
101110112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5802120.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101110112121 its reverse (121211011101), we get a palindrome (222321123222).
It can be divided in two parts, 1011101 and 12121, that multiplied together give a palindrome (12255555221).
The spelling of 101110112121 in words is "one hundred one billion, one hundred ten million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •