Base | Representation |
---|---|
bin | 1001001101101001010011… |
… | …1001101000100001001111 |
3 | 1022212102101021112111001012 |
4 | 2103122110321220201033 |
5 | 2311432300420120421 |
6 | 33313401053035435 |
7 | 2063604416646302 |
oct | 223322471504117 |
9 | 38772337474035 |
10 | 10130031020111 |
11 | 3256138470002 |
12 | 1177326a85b7b |
13 | 5863475a1442 |
14 | 270420790b39 |
15 | 12878a88295b |
hex | 93694e6884f |
10130031020111 has 8 divisors (see below), whose sum is σ = 10286277855264. Its totient is φ = 9974161139040.
The previous prime is 10130031020093. The next prime is 10130031020143. The reversal of 10130031020111 is 11102013003101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10130031020111 - 230 = 10128957278287 is a prime.
It is a super-2 number, since 2×101300310201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130031020311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94184360 + ... + 94291853.
It is an arithmetic number, because the mean of its divisors is an integer number (1285784731908).
Almost surely, 210130031020111 is an apocalyptic number.
10130031020111 is a deficient number, since it is larger than the sum of its proper divisors (156246835153).
10130031020111 is an equidigital number, since it uses as much as digits as its factorization.
10130031020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188477041.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10130031020111 its reverse (11102013003101), we get a palindrome (21232044023212).
The spelling of 10130031020111 in words is "ten trillion, one hundred thirty billion, thirty-one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •