Base | Representation |
---|---|
bin | 101111110001010111111010… |
… | …101011110101000110010000 |
3 | 1000112220110201100212222011121 |
4 | 233301113322223311012100 |
5 | 210014244043434341422 |
6 | 2022503042244452024 |
7 | 62153206432256401 |
oct | 5761277253650620 |
9 | 1015813640788147 |
10 | 210101121012112 |
11 | 60a43426539460 |
12 | 1b6930083aa014 |
13 | 90305b22537c5 |
14 | 39c4d3ca219a8 |
15 | 194532b8538c7 |
hex | bf15faaf5190 |
210101121012112 has 20 divisors (see below), whose sum is σ = 444077369412336. Its totient is φ = 95500509550880.
The previous prime is 210101121012059. The next prime is 210101121012121. The reversal of 210101121012112 is 211210121101012.
It is a super-2 number, since 2×2101011210121122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 596878184518 + ... + 596878184869.
Almost surely, 2210101121012112 is an apocalyptic number.
210101121012112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210101121012112 is an abundant number, since it is smaller than the sum of its proper divisors (233976248400224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210101121012112 is a wasteful number, since it uses less digits than its factorization.
210101121012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1193756369406 (or 1193756369400 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 210101121012112 its reverse (211210121101012), we get a palindrome (421311242113124).
The spelling of 210101121012112 in words is "two hundred ten trillion, one hundred one billion, one hundred twenty-one million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •