Base | Representation |
---|---|
bin | 11101011001101010100… |
… | …10010101000110001100 |
3 | 10120120112100210211012020 |
4 | 32230311102111012030 |
5 | 113022403043441022 |
6 | 2052030142210140 |
7 | 132661656321000 |
oct | 16546522250614 |
9 | 3516470724166 |
10 | 1010211312012 |
11 | 35a478a49831 |
12 | 143951883950 |
13 | 743549a10b6 |
14 | 36c74694700 |
15 | 1b427e6535c |
hex | eb3549518c |
1010211312012 has 96 divisors (see below), whose sum is σ = 2843663424000. Its totient is φ = 278678949696.
The previous prime is 1010211312007. The next prime is 1010211312043. The reversal of 1010211312012 is 2102131120101.
It is a junction number, because it is equal to n+sod(n) for n = 1010211311982 and 1010211312000.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4112278 + ... + 4351005.
It is an arithmetic number, because the mean of its divisors is an integer number (29621494000).
Almost surely, 21010211312012 is an apocalyptic number.
1010211312012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010211312012 is an abundant number, since it is smaller than the sum of its proper divisors (1833452111988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010211312012 is a wasteful number, since it uses less digits than its factorization.
1010211312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8463340 (or 8463324 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1010211312012 its reverse (2102131120101), we get a palindrome (3112342432113).
The spelling of 1010211312012 in words is "one trillion, ten billion, two hundred eleven million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •