Base | Representation |
---|---|
bin | 11110000000011010001… |
… | …11000111011000110000 |
3 | 10122120020000012100122020 |
4 | 33000031013013120300 |
5 | 113343003100320422 |
6 | 2105350155511440 |
7 | 134326304265252 |
oct | 17001507073060 |
9 | 3576200170566 |
10 | 1031012120112 |
11 | 368282510827 |
12 | 147997a58580 |
13 | 762bb252680 |
14 | 37c89075cd2 |
15 | 1bc4416795c |
hex | f00d1c7630 |
1031012120112 has 40 divisors (see below), whose sum is σ = 2868328592304. Its totient is φ = 317234498304.
The previous prime is 1031012120101. The next prime is 1031012120129. The reversal of 1031012120112 is 2110212101301.
It is a super-2 number, since 2×10310121201122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031012120091 and 1031012120100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 826130883 + ... + 826132130.
Almost surely, 21031012120112 is an apocalyptic number.
1031012120112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1031012120112 is an abundant number, since it is smaller than the sum of its proper divisors (1837316472192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031012120112 is a wasteful number, since it uses less digits than its factorization.
1031012120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1652263037 (or 1652263031 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1031012120112 its reverse (2110212101301), we get a palindrome (3141224221413).
The spelling of 1031012120112 in words is "one trillion, thirty-one billion, twelve million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •