Base | Representation |
---|---|
bin | 11101011101001101000… |
… | …01110101101100111010 |
3 | 10120202102202210021211221 |
4 | 32232212201311230322 |
5 | 113040300432000010 |
6 | 2052542451342254 |
7 | 133060026165106 |
oct | 16564641655472 |
9 | 3522382707757 |
10 | 1012111203130 |
11 | 360263430085 |
12 | 1441a1bb198a |
13 | 74598497221 |
14 | 36db4b30906 |
15 | 1b4d9b50dda |
hex | eba6875b3a |
1012111203130 has 8 divisors (see below), whose sum is σ = 1821800165652. Its totient is φ = 404844481248.
The previous prime is 1012111203073. The next prime is 1012111203197. The reversal of 1012111203130 is 313021112101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1002599687401 + 9511515729 = 1001299^2 + 97527^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10121112031302 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 50605560147 + ... + 50605560166.
Almost surely, 21012111203130 is an apocalyptic number.
1012111203130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012111203130 is a deficient number, since it is larger than the sum of its proper divisors (809688962522).
1012111203130 is a wasteful number, since it uses less digits than its factorization.
1012111203130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101211120320.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1012111203130 its reverse (313021112101), we get a palindrome (1325132315231).
The spelling of 1012111203130 in words is "one trillion, twelve billion, one hundred eleven million, two hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •