Base | Representation |
---|---|
bin | 1100001110010100101… |
… | …0010010110001110111 |
3 | 202002001110220101011011 |
4 | 3003211022102301313 |
5 | 11420041244023111 |
6 | 240250223253051 |
7 | 21113033664010 |
oct | 3034512226167 |
9 | 662043811134 |
10 | 210003111031 |
11 | 8107531060a |
12 | 3484974a187 |
13 | 16a5985869c |
14 | a242814007 |
15 | 56e1749021 |
hex | 30e5292c77 |
210003111031 has 16 divisors (see below), whose sum is σ = 241062393600. Its totient is φ = 179209152000.
The previous prime is 210003111007. The next prime is 210003111113. The reversal of 210003111031 is 130111300012.
210003111031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 210003111031 - 27 = 210003110903 is a prime.
It is a super-2 number, since 2×2100031110312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210003111001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4310295 + ... + 4358743.
It is an arithmetic number, because the mean of its divisors is an integer number (15066399600).
Almost surely, 2210003111031 is an apocalyptic number.
210003111031 is a deficient number, since it is larger than the sum of its proper divisors (31059282569).
210003111031 is a wasteful number, since it uses less digits than its factorization.
210003111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51174.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 210003111031 its reverse (130111300012), we get a palindrome (340114411043).
The spelling of 210003111031 in words is "two hundred ten billion, three million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •