Base | Representation |
---|---|
bin | 10011000110000111000… |
… | …100110110101101011110 |
3 | 11122110002122112220200110 |
4 | 103012013010312231132 |
5 | 132444422143101420 |
6 | 2442455233110450 |
7 | 163543212231144 |
oct | 23060704665536 |
9 | 4573078486613 |
10 | 1312231222110 |
11 | 466572351416 |
12 | 19239b6b8426 |
13 | 96987128583 |
14 | 47725b95594 |
15 | 24202b1aee0 |
hex | 13187136b5e |
1312231222110 has 32 divisors (see below), whose sum is σ = 3149485195680. Its totient is φ = 349913852288.
The previous prime is 1312231222109. The next prime is 1312231222111. The reversal of 1312231222110 is 112221322131.
It is an interprime number because it is at equal distance from previous prime (1312231222109) and next prime (1312231222111).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312231222111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157077 + ... + 1627616.
It is an arithmetic number, because the mean of its divisors is an integer number (98421412365).
Almost surely, 21312231222110 is an apocalyptic number.
1312231222110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1312231222110 is an abundant number, since it is smaller than the sum of its proper divisors (1837253973570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312231222110 is a wasteful number, since it uses less digits than its factorization.
1312231222110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1809212.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1312231222110 its reverse (112221322131), we get a palindrome (1424452544241).
The spelling of 1312231222110 in words is "one trillion, three hundred twelve billion, two hundred thirty-one million, two hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •