Base | Representation |
---|---|
bin | 1100001110010100101… |
… | …0101000111111101111 |
3 | 202002001111001222222112 |
4 | 3003211022220333233 |
5 | 11420041304431111 |
6 | 240250225234235 |
7 | 21113034523220 |
oct | 3034512507757 |
9 | 662044058875 |
10 | 210003202031 |
11 | 81075372a17 |
12 | 3484979297b |
13 | 16a5988ac2c |
14 | a242839247 |
15 | 56e1765e8b |
hex | 30e52a8fef |
210003202031 has 4 divisors (see below), whose sum is σ = 240003659472. Its totient is φ = 180002744592.
The previous prime is 210003202001. The next prime is 210003202037. The reversal of 210003202031 is 130202300012.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210003202031 is a prime.
It is a super-2 number, since 2×2100032020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210003201997 and 210003202015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210003202037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15000228710 + ... + 15000228723.
It is an arithmetic number, because the mean of its divisors is an integer number (60000914868).
Almost surely, 2210003202031 is an apocalyptic number.
210003202031 is a deficient number, since it is larger than the sum of its proper divisors (30000457441).
210003202031 is an equidigital number, since it uses as much as digits as its factorization.
210003202031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30000457440.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 210003202031 its reverse (130202300012), we get a palindrome (340205502043).
The spelling of 210003202031 in words is "two hundred ten billion, three million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •