Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011110000110100101001100 |
3 | 111020222011200000211220021220 |
4 | 112333031300132012211030 |
5 | 101222420044230320022 |
6 | 555005114143123340 |
7 | 30203213024551560 |
oct | 2677156036064514 |
9 | 436864600756256 |
10 | 101101122120012 |
11 | 2a239821810583 |
12 | b40a0a92a3550 |
13 | 4454a44548251 |
14 | 1ad746b3356a0 |
15 | ba4d13a2585c |
hex | 5bf37078694c |
101101122120012 has 48 divisors (see below), whose sum is σ = 269604537898752. Its totient is φ = 28885869293760.
The previous prime is 101101122119999. The next prime is 101101122120091. The reversal of 101101122120012 is 210021221101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101122119973 and 101101122120000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11682562 + ... + 18403382.
It is an arithmetic number, because the mean of its divisors is an integer number (5616761206224).
Almost surely, 2101101122120012 is an apocalyptic number.
101101122120012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101101122120012 is an abundant number, since it is smaller than the sum of its proper divisors (168503415778740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101122120012 is a wasteful number, since it uses less digits than its factorization.
101101122120012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6899918 (or 6899916 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101101122120012 its reverse (210021221101101), we get a palindrome (311122343221113).
The spelling of 101101122120012 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-two million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •