Base | Representation |
---|---|
bin | 1001011000001000001101… |
… | …0010001101111001101111 |
3 | 1100111122020021102220120202 |
4 | 2112002003102031321233 |
5 | 2322410113232214411 |
6 | 33532223340504115 |
7 | 2112611325614033 |
oct | 226020322157157 |
9 | 40448207386522 |
10 | 10310124101231 |
11 | 33155542a8429 |
12 | 11a620784b03b |
13 | 59a3185a6176 |
14 | 279026a9a1c3 |
15 | 12d2cb32583b |
hex | 9608348de6f |
10310124101231 has 8 divisors (see below), whose sum is σ = 10340951031840. Its totient is φ = 10279298550528.
The previous prime is 10310124101197. The next prime is 10310124101243. The reversal of 10310124101231 is 13210142101301.
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 10310124101231 - 238 = 10035246194287 is a prime.
It is a super-2 number, since 2×103101241012312 (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 (10310124101531) 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, 15739430 + ... + 16381388.
It is an arithmetic number, because the mean of its divisors is an integer number (1292618878980).
Almost surely, 210310124101231 is an apocalyptic number.
10310124101231 is a deficient number, since it is larger than the sum of its proper divisors (30826930609).
10310124101231 is an equidigital number, since it uses as much as digits as its factorization.
10310124101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689953.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10310124101231 its reverse (13210142101301), we get a palindrome (23520266202532).
The spelling of 10310124101231 in words is "ten trillion, three hundred ten billion, one hundred twenty-four million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •