Base | Representation |
---|---|
bin | 11101100011110011101… |
… | …001000110100111110110 |
3 | 21012012011122021112101210 |
4 | 131203303221012213312 |
5 | 231240111410432410 |
6 | 4153101050102250 |
7 | 266520544555263 |
oct | 35436351064766 |
9 | 7165148245353 |
10 | 2031312202230 |
11 | 713524866873 |
12 | 28982241a986 |
13 | 11972374749c |
14 | 7045d2b426a |
15 | 37c8be07220 |
hex | 1d8f3a469f6 |
2031312202230 has 64 divisors (see below), whose sum is σ = 5011493957568. Its totient is φ = 526560652800.
The previous prime is 2031312202219. The next prime is 2031312202259. The reversal of 2031312202230 is 322022131302.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2031312202197 and 2031312202206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 376080 + ... + 2050380.
It is an arithmetic number, because the mean of its divisors is an integer number (78304593087).
Almost surely, 22031312202230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2031312202230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2505746978784).
2031312202230 is an abundant number, since it is smaller than the sum of its proper divisors (2980181755338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2031312202230 is a wasteful number, since it uses less digits than its factorization.
2031312202230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1675441.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2031312202230 its reverse (322022131302), we get a palindrome (2353334333532).
The spelling of 2031312202230 in words is "two trillion, thirty-one billion, three hundred twelve million, two hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •