Base | Representation |
---|---|
bin | 11101011001110110100… |
… | …01001000001010110100 |
3 | 10120120210100122001001020 |
4 | 32230323101020022310 |
5 | 113023104241111322 |
6 | 2052044125101140 |
7 | 132664315263231 |
oct | 16547321101264 |
9 | 3516710561036 |
10 | 1010311660212 |
11 | 35a51a658928 |
12 | 14397b3b77b0 |
13 | 7436c70722a |
14 | 36c83b36788 |
15 | 1b431b8805c |
hex | eb3b4482b4 |
1010311660212 has 48 divisors (see below), whose sum is σ = 2373085307712. Its totient is φ = 334530144000.
The previous prime is 1010311660153. The next prime is 1010311660217. The reversal of 1010311660212 is 2120661130101.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010311660217) 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 15 ways as a sum of consecutive naturals, for example, 6694587 + ... + 6843837.
It is an arithmetic number, because the mean of its divisors is an integer number (49439277244).
Almost surely, 21010311660212 is an apocalyptic number.
1010311660212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010311660212 is an abundant number, since it is smaller than the sum of its proper divisors (1362773647500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010311660212 is a wasteful number, since it uses less digits than its factorization.
1010311660212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153008 (or 153006 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 1010311660212 its reverse (2120661130101), we get a palindrome (3130972790313).
The spelling of 1010311660212 in words is "one trillion, ten billion, three hundred eleven million, six hundred sixty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •