Base | Representation |
---|---|
bin | 11110100101110110110… |
… | …011011011101100101111 |
3 | 21102222020011202210202002 |
4 | 132211312303123230233 |
5 | 233420332420431111 |
6 | 4245430243522515 |
7 | 304611162612143 |
oct | 36456663335457 |
9 | 7388204683662 |
10 | 2102232202031 |
11 | 740608300355 |
12 | 29b51538943b |
13 | 12331666b800 |
14 | 73a6a171223 |
15 | 39a3d19563b |
hex | 1e976cdbb2f |
2102232202031 has 12 divisors (see below), whose sum is σ = 2349813286080. Its totient is φ = 1877924543040.
The previous prime is 2102232202003. The next prime is 2102232202051. The reversal of 2102232202031 is 1302022322012.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-2102232202031 is a prime.
It is a super-2 number, since 2×21022322020312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2102232201994 and 2102232202012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102232202051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200627726 + ... + 200638203.
It is an arithmetic number, because the mean of its divisors is an integer number (195817773840).
Almost surely, 22102232202031 is an apocalyptic number.
2102232202031 is a deficient number, since it is larger than the sum of its proper divisors (247581084049).
2102232202031 is a wasteful number, since it uses less digits than its factorization.
2102232202031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401265986 (or 401265973 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2102232202031 its reverse (1302022322012), we get a palindrome (3404254524043).
The spelling of 2102232202031 in words is "two trillion, one hundred two billion, two hundred thirty-two million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •