Base | Representation |
---|---|
bin | 1100001110010100101… |
… | …1011100100101000001 |
3 | 202002001111110201210210 |
4 | 3003211023130211001 |
5 | 11420041333211223 |
6 | 240250233544333 |
7 | 21113036363211 |
oct | 3034513344501 |
9 | 662044421723 |
10 | 210003413313 |
11 | 810754a7731 |
12 | 348498750a9 |
13 | 16a59933155 |
14 | a242892241 |
15 | 56e17a8893 |
hex | 30e52dc941 |
210003413313 has 32 divisors (see below), whose sum is σ = 295371878400. Its totient is φ = 132350486976.
The previous prime is 210003413293. The next prime is 210003413329. The reversal of 210003413313 is 313314300012.
It is not a de Polignac number, because 210003413313 - 214 = 210003396929 is a prime.
It is a super-2 number, since 2×2100034133132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 210003413313.
It is not an unprimeable number, because it can be changed into a prime (210003413383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87903123 + ... + 87905511.
It is an arithmetic number, because the mean of its divisors is an integer number (9230371200).
Almost surely, 2210003413313 is an apocalyptic number.
It is an amenable number.
210003413313 is a deficient number, since it is larger than the sum of its proper divisors (85368465087).
210003413313 is a wasteful number, since it uses less digits than its factorization.
210003413313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5061.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 210003413313 its reverse (313314300012), we get a palindrome (523317713325).
The spelling of 210003413313 in words is "two hundred ten billion, three million, four hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •