Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …101000111101100011100101 |
3 | 1000112221112100011202220222110 |
4 | 233301202033220331203211 |
5 | 210014434301230000401 |
6 | 2022512114452151233 |
7 | 62154051302151423 |
oct | 5761421750754345 |
9 | 1015845304686873 |
10 | 210112210000101 |
11 | 60a480a6a27242 |
12 | 1b6951a2008519 |
13 | 903165b737566 |
14 | 39c56b1658113 |
15 | 194577a11e9d6 |
hex | bf188fa3d8e5 |
210112210000101 has 16 divisors (see below), whose sum is σ = 283038613976384. Its totient is φ = 138630315124224.
The previous prime is 210112210000067. The next prime is 210112210000123. The reversal of 210112210000101 is 101000012211012.
It is not a de Polignac number, because 210112210000101 - 214 = 210112209983717 is a prime.
It is a super-2 number, since 2×2101122100001012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210112210000201) 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, 116378055 + ... + 118169691.
It is an arithmetic number, because the mean of its divisors is an integer number (17689913373524).
Almost surely, 2210112210000101 is an apocalyptic number.
It is an amenable number.
210112210000101 is a deficient number, since it is larger than the sum of its proper divisors (72926403976283).
210112210000101 is a wasteful number, since it uses less digits than its factorization.
210112210000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2194740.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210112210000101 its reverse (101000012211012), we get a palindrome (311112222211113).
The spelling of 210112210000101 in words is "two hundred ten trillion, one hundred twelve billion, two hundred ten million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •