Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10101000000000001 |
3 | 222001220010022001022 |
4 | 21122000311000001 |
5 | 131141111213441 |
6 | 4350120115225 |
7 | 505201304645 |
oct | 113200650001 |
9 | 28056108038 |
10 | 10100101121 |
11 | 4313275510 |
12 | 1b5a605b15 |
13 | c4c667cc6 |
14 | 6bb57cc25 |
15 | 3e1a8284b |
hex | 25a035001 |
10100101121 has 16 divisors (see below), whose sum is σ = 11406571200. Its totient is φ = 8858808000.
The previous prime is 10100101117. The next prime is 10100101163. The reversal of 10100101121 is 12110100101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10100101121 - 22 = 10100101117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100101099 and 10100101108.
It is not an unprimeable number, because it can be changed into a prime (10100101181) 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, 454571 + ... + 476271.
It is an arithmetic number, because the mean of its divisors is an integer number (712910700).
Almost surely, 210100101121 is an apocalyptic number.
10100101121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10100101121 is a deficient number, since it is larger than the sum of its proper divisors (1306470079).
10100101121 is a wasteful number, since it uses less digits than its factorization.
10100101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23200.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10100101121 its reverse (12110100101), we get a palindrome (22210201222).
It can be divided in two parts, 10100101 and 121, that multiplied together give a palindrome (1222112221).
The spelling of 10100101121 in words is "ten billion, one hundred million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •