Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …01110000111101111000 |
3 | 10120120020202022220002210 |
4 | 32230232301300331320 |
5 | 113022142120041440 |
6 | 2052011241455120 |
7 | 132656162200653 |
oct | 16545661607570 |
9 | 3516222286083 |
10 | 1010102112120 |
11 | 35a422344292 |
12 | 1439211a14a0 |
13 | 74338188c8a |
14 | 36c63d8a89a |
15 | 1b41d594a80 |
hex | eb2ec70f78 |
1010102112120 has 32 divisors (see below), whose sum is σ = 3030306336720. Its totient is φ = 269360563200.
The previous prime is 1010102112113. The next prime is 1010102112143. The reversal of 1010102112120 is 212112010101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1010102112096 and 1010102112105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4208758681 + ... + 4208758920.
Almost surely, 21010102112120 is an apocalyptic number.
1010102112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010102112120 is an abundant number, since it is smaller than the sum of its proper divisors (2020204224600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010102112120 is a wasteful number, since it uses less digits than its factorization.
1010102112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8417517615 (or 8417517611 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1010102112120 its reverse (212112010101), we get a palindrome (1222214122221).
The spelling of 1010102112120 in words is "one trillion, ten billion, one hundred two million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •