Base | Representation |
---|---|
bin | 1001001101101010010110… |
… | …1110011111011100001011 |
3 | 1022212110002221201101201202 |
4 | 2103122211232133130023 |
5 | 2311433340201441021 |
6 | 33313445055334415 |
7 | 2063614415253614 |
oct | 223324556373413 |
9 | 38773087641652 |
10 | 10130313312011 |
11 | 325627284a0a2 |
12 | 11773a552140b |
13 | 586390c0c079 |
14 | 27044a074c0b |
15 | 1287a5544a0b |
hex | 936a5b9f70b |
10130313312011 has 4 divisors (see below), whose sum is σ = 10162886667024. Its totient is φ = 10097739957000.
The previous prime is 10130313311999. The next prime is 10130313312023. The reversal of 10130313312011 is 11021331303101.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10130313311999) and next prime (10130313312023).
It is a cyclic number.
It is not a de Polignac number, because 10130313312011 - 242 = 5732266800907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10130319312011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16286677040 + ... + 16286677661.
It is an arithmetic number, because the mean of its divisors is an integer number (2540721666756).
Almost surely, 210130313312011 is an apocalyptic number.
10130313312011 is a deficient number, since it is larger than the sum of its proper divisors (32573355013).
10130313312011 is an equidigital number, since it uses as much as digits as its factorization.
10130313312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32573355012.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 10130313312011 its reverse (11021331303101), we get a palindrome (21151644615112).
The spelling of 10130313312011 in words is "ten trillion, one hundred thirty billion, three hundred thirteen million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •