Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …1100011001100101011110 |
3 | 1100110202222021212021022001 |
4 | 2111321222030121211132 |
5 | 2322233134440224410 |
6 | 33524133250112514 |
7 | 2112142121405512 |
oct | 225715214314536 |
9 | 40422867767261 |
10 | 10301113211230 |
11 | 331174a9493a6 |
12 | 11a4511b7b73a |
13 | 5995107b21aa |
14 | 27881004c142 |
15 | 12ce501e733a |
hex | 95e6a31995e |
10301113211230 has 16 divisors (see below), whose sum is σ = 18750340902960. Its totient is φ = 4074148146112.
The previous prime is 10301113211227. The next prime is 10301113211251. The reversal of 10301113211230 is 3211231110301.
It is a super-2 number, since 2×103011132112302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301113211198 and 10301113211207.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 5787141364 + ... + 5787143143.
It is an arithmetic number, because the mean of its divisors is an integer number (1171896306435).
Almost surely, 210301113211230 is an apocalyptic number.
10301113211230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10301113211230 is a deficient number, since it is larger than the sum of its proper divisors (8449227691730).
10301113211230 is a wasteful number, since it uses less digits than its factorization.
10301113211230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11574284603.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10301113211230 its reverse (3211231110301), we get a palindrome (13512344321531).
The spelling of 10301113211230 in words is "ten trillion, three hundred one billion, one hundred thirteen million, two hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •