Base | Representation |
---|---|
bin | 11101011001100001000… |
… | …00110001001101111100 |
3 | 10120120022210002021102222 |
4 | 32230300200301031330 |
5 | 113022222042224012 |
6 | 2052014201304512 |
7 | 132656664424511 |
oct | 16546040611574 |
9 | 3516283067388 |
10 | 1010131211132 |
11 | 35a43780985a |
12 | 14392aa95138 |
13 | 74341206b24 |
14 | 36c67ba3308 |
15 | 1b420de1972 |
hex | eb3083137c |
1010131211132 has 12 divisors (see below), whose sum is σ = 1768509401400. Its totient is φ = 504842810736.
The previous prime is 1010131211099. The next prime is 1010131211137. The reversal of 1010131211132 is 2311121310101.
It is a self number, because there is not a number n which added to its sum of digits gives 1010131211132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010131211137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55688507 + ... + 55706642.
It is an arithmetic number, because the mean of its divisors is an integer number (147375783450).
Almost surely, 21010131211132 is an apocalyptic number.
It is an amenable number.
1010131211132 is a deficient number, since it is larger than the sum of its proper divisors (758378190268).
1010131211132 is a wasteful number, since it uses less digits than its factorization.
1010131211132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111397420 (or 111397418 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1010131211132 its reverse (2311121310101), we get a palindrome (3321252521233).
The spelling of 1010131211132 in words is "one trillion, ten billion, one hundred thirty-one million, two hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •