Base | Representation |
---|---|
bin | 1100001111000011100… |
… | …1011001110100100110 |
3 | 202002120012101212210101 |
4 | 3003300321121310212 |
5 | 11420442200310042 |
6 | 240321535414314 |
7 | 21120644414362 |
oct | 3036071316446 |
9 | 662505355711 |
10 | 210200010022 |
11 | 81166475752 |
12 | 348a368439a |
13 | 16a8b598372 |
14 | a260a2a2a2 |
15 | 5703b8e6b7 |
hex | 30f0e59d26 |
210200010022 has 8 divisors (see below), whose sum is σ = 315311891400. Its totient is φ = 105096046224.
The previous prime is 210200010017. The next prime is 210200010043. The reversal of 210200010022 is 220010002012.
210200010022 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2102000100223 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210200009990 and 210200010008.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1912572 + ... + 2019487.
It is an arithmetic number, because the mean of its divisors is an integer number (39413986425).
Almost surely, 2210200010022 is an apocalyptic number.
210200010022 is a deficient number, since it is larger than the sum of its proper divisors (105111881378).
210200010022 is a wasteful number, since it uses less digits than its factorization.
210200010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3958790.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 210200010022 its reverse (220010002012), we get a palindrome (430210012034).
The spelling of 210200010022 in words is "two hundred ten billion, two hundred million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •