Base | Representation |
---|---|
bin | 1100001110101011110… |
… | …0010110101010010010 |
3 | 202002022020102221201201 |
4 | 3003222330112222102 |
5 | 11420241112321320 |
6 | 240304010421414 |
7 | 21115322361421 |
oct | 3035274265222 |
9 | 662266387651 |
10 | 210100120210 |
11 | 81115049a92 |
12 | 3487613186a |
13 | 16a73992a76 |
14 | a2516672b8 |
15 | 56ea00c70a |
hex | 30eaf16a92 |
210100120210 has 32 divisors (see below), whose sum is σ = 382009124592. Its totient is φ = 83189548800.
The previous prime is 210100120207. The next prime is 210100120213. The reversal of 210100120210 is 12021001012.
210100120210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (210100120207) and next prime (210100120213).
It can be written as a sum of positive squares in 8 ways, for example, as 208966922641 + 1133197569 = 457129^2 + 33663^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (210100120213) 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, 5107284 + ... + 5148256.
Almost surely, 2210100120210 is an apocalyptic number.
210100120210 is a deficient number, since it is larger than the sum of its proper divisors (171909004382).
210100120210 is a wasteful number, since it uses less digits than its factorization.
210100120210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46158.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 210100120210 its reverse (12021001012), we get a palindrome (222121121222).
The spelling of 210100120210 in words is "two hundred ten billion, one hundred million, one hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •