Base | Representation |
---|---|
bin | 11101011001011111111… |
… | …10000001010101110100 |
3 | 10120120022010221111020121 |
4 | 32230233332001111310 |
5 | 113022212224232012 |
6 | 2052013234141324 |
7 | 132656524125613 |
oct | 16545776012564 |
9 | 3516263844217 |
10 | 1010122102132 |
11 | 35a432658060 |
12 | 143927a21844 |
13 | 7433c3679a0 |
14 | 36c668b187a |
15 | 1b4201e2a07 |
hex | eb2ff81574 |
1010122102132 has 48 divisors (see below), whose sum is σ = 2097316577664. Its totient is φ = 419631120000.
The previous prime is 1010122102051. The next prime is 1010122102133. The reversal of 1010122102132 is 2312012210101.
It is a super-2 number, since 2×10101221021322 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010122102133) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 8684544 + ... + 8800087.
It is an arithmetic number, because the mean of its divisors is an integer number (43694095368).
Almost surely, 21010122102132 is an apocalyptic number.
It is an amenable number.
1010122102132 is an abundant number, since it is smaller than the sum of its proper divisors (1087194475532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010122102132 is a wasteful number, since it uses less digits than its factorization.
1010122102132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17484760 (or 17484758 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1010122102132 its reverse (2312012210101), we get a palindrome (3322134312233).
The spelling of 1010122102132 in words is "one trillion, ten billion, one hundred twenty-two million, one hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •