Base | Representation |
---|---|
bin | 10110111101110000101000… |
… | …000000011000100110001000 |
3 | 111020121121112212012122221021 |
4 | 112331300220000120212020 |
5 | 101214300244230401440 |
6 | 554451135220122224 |
7 | 30163042650602323 |
oct | 2675605000304610 |
9 | 436547485178837 |
10 | 101001122122120 |
11 | 2a200376387020 |
12 | b3b283b536374 |
13 | 4448498a3976c |
14 | 1ad26a22b57ba |
15 | ba240e7db84a |
hex | 5bdc28018988 |
101001122122120 has 64 divisors (see below), whose sum is σ = 250366418043840. Its totient is φ = 36364040352000.
The previous prime is 101001122122091. The next prime is 101001122122157. The reversal of 101001122122120 is 21221221100101.
It is a junction number, because it is equal to n+sod(n) for n = 101001122122094 and 101001122122103.
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, 1136331822 + ... + 1136420701.
It is an arithmetic number, because the mean of its divisors is an integer number (3911975281935).
Almost surely, 2101001122122120 is an apocalyptic number.
101001122122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101001122122120 is an abundant number, since it is smaller than the sum of its proper divisors (149365295921720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001122122120 is a wasteful number, since it uses less digits than its factorization.
101001122122120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2272752646 (or 2272752642 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101001122122120 its reverse (21221221100101), we get a palindrome (122222343222221).
The spelling of 101001122122120 in words is "one hundred one trillion, one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •