Base | Representation |
---|---|
bin | 1110000110001110100111… |
… | …10010000110101000111011 |
3 | 11001202121021110000201112202 |
4 | 13003013103302012220323 |
5 | 13030402140004232303 |
6 | 145533204515500415 |
7 | 6346462062100232 |
oct | 703072362065073 |
9 | 131677243021482 |
10 | 31000332102203 |
11 | 9972192327282 |
12 | 35880a45b770b |
13 | 143b41b465669 |
14 | 7925d1961b19 |
15 | 38b5ca790c88 |
hex | 1c31d3c86a3b |
31000332102203 has 16 divisors (see below), whose sum is σ = 31531549687200. Its totient is φ = 30473198004480.
The previous prime is 31000332102197. The next prime is 31000332102241. The reversal of 31000332102203 is 30220123300013.
It is a cyclic number.
It is not a de Polignac number, because 31000332102203 - 212 = 31000332098107 is a prime.
It is a super-2 number, since 2×310003321022032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31000332102263) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 368084768 + ... + 368168978.
It is an arithmetic number, because the mean of its divisors is an integer number (1970721855450).
Almost surely, 231000332102203 is an apocalyptic number.
31000332102203 is a deficient number, since it is larger than the sum of its proper divisors (531217584997).
31000332102203 is a wasteful number, since it uses less digits than its factorization.
31000332102203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108382.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 31000332102203 its reverse (30220123300013), we get a palindrome (61220455402216).
The spelling of 31000332102203 in words is "thirty-one trillion, three hundred thirty-two million, one hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •