Base | Representation |
---|---|
bin | 1001001101101010010110… |
… | …1001100100010010000001 |
3 | 1022212110002212021210222000 |
4 | 2103122211221210102001 |
5 | 2311433334334133441 |
6 | 33313445011534213 |
7 | 2063614401266235 |
oct | 223324551442201 |
9 | 38773085253860 |
10 | 10130312021121 |
11 | 3256272048246 |
12 | 11773a4bba369 |
13 | 586390879626 |
14 | 270449c1a5c5 |
15 | 1287a538c2b6 |
hex | 936a5a64481 |
10130312021121 has 64 divisors (see below), whose sum is σ = 15220222617600. Its totient is φ = 6658604568000.
The previous prime is 10130312021117. The next prime is 10130312021147. The reversal of 10130312021121 is 12112021303101.
10130312021121 is a `hidden beast` number, since 10 + 1 + 303 + 120 + 211 + 21 = 666.
It is not a de Polignac number, because 10130312021121 - 22 = 10130312021117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10130312021094 and 10130312021103.
It is not an unprimeable number, because it can be changed into a prime (10130312021101) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 652424260 + ... + 652439786.
It is an arithmetic number, because the mean of its divisors is an integer number (237815978400).
Almost surely, 210130312021121 is an apocalyptic number.
It is an amenable number.
10130312021121 is a deficient number, since it is larger than the sum of its proper divisors (5089910596479).
10130312021121 is a wasteful number, since it uses less digits than its factorization.
10130312021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16627 (or 16621 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10130312021121 its reverse (12112021303101), we get a palindrome (22242333324222).
The spelling of 10130312021121 in words is "ten trillion, one hundred thirty billion, three hundred twelve million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •