Base | Representation |
---|---|
bin | 1100001110010100011… |
… | …0110100100110110101 |
3 | 202002001102012010211210 |
4 | 3003211012310212311 |
5 | 11420041030413023 |
6 | 240250151552033 |
7 | 21113023153623 |
oct | 3034506644665 |
9 | 662042163753 |
10 | 210002201013 |
11 | 81074849930 |
12 | 3484938b619 |
13 | 16a595ca407 |
14 | a242658513 |
15 | 56e1619593 |
hex | 30e51b49b5 |
210002201013 has 32 divisors (see below), whose sum is σ = 313539467904. Its totient is φ = 123948000000.
The previous prime is 210002200951. The next prime is 210002201141. The reversal of 210002201013 is 310102200012.
210002201013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210002201013 - 29 = 210002200501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210002201013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002209013) 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 31 ways as a sum of consecutive naturals, for example, 313138 + ... + 719763.
It is an arithmetic number, because the mean of its divisors is an integer number (9798108372).
Almost surely, 2210002201013 is an apocalyptic number.
It is an amenable number.
210002201013 is a deficient number, since it is larger than the sum of its proper divisors (103537266891).
210002201013 is a wasteful number, since it uses less digits than its factorization.
210002201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033077.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 210002201013 its reverse (310102200012), we get a palindrome (520104401025).
The spelling of 210002201013 in words is "two hundred ten billion, two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •