Base | Representation |
---|---|
bin | 1001011000001011110110… |
… | …0101000110100010000110 |
3 | 1100111201202102202221020222 |
4 | 2112002331211012202012 |
5 | 2322414114121132220 |
6 | 33532504355224342 |
7 | 2112644502666542 |
oct | 226027545064206 |
9 | 40451672687228 |
10 | 10311102130310 |
11 | 3315a06385123 |
12 | 11a643b2a80b2 |
13 | 59a4430bcab7 |
14 | 2790ba928a22 |
15 | 12d337116e25 |
hex | 960bd946886 |
10311102130310 has 32 divisors (see below), whose sum is σ = 19708380980640. Its totient is φ = 3870639841792.
The previous prime is 10311102130247. The next prime is 10311102130337. The reversal of 10311102130310 is 1303120111301.
It is a super-2 number, since 2×103111021303102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87338045 + ... + 87456024.
It is an arithmetic number, because the mean of its divisors is an integer number (615886905645).
Almost surely, 210311102130310 is an apocalyptic number.
10311102130310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10311102130310 is a deficient number, since it is larger than the sum of its proper divisors (9397278850330).
10311102130310 is a wasteful number, since it uses less digits than its factorization.
10311102130310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174794440.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10311102130310 its reverse (1303120111301), we get a palindrome (11614222241611).
The spelling of 10311102130310 in words is "ten trillion, three hundred eleven billion, one hundred two million, one hundred thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •