Base | Representation |
---|---|
bin | 101111110011000110110101… |
… | …000000000111101010100010 |
3 | 1000120022212002221201200201220 |
4 | 233303012311000013222202 |
5 | 210023221443004311320 |
6 | 2023033455352435510 |
7 | 62164623541455132 |
oct | 5763066500075242 |
9 | 1016285087650656 |
10 | 210220211010210 |
11 | 60a8998875a695 |
12 | 1b6b21033a8b96 |
13 | 903b8b0a51abb |
14 | 39ca9d9166ac2 |
15 | 194849b9a3e40 |
hex | bf31b5007aa2 |
210220211010210 has 32 divisors (see below), whose sum is σ = 505531545240960. Its totient is φ = 55947274178688.
The previous prime is 210220211010169. The next prime is 210220211010289. The reversal of 210220211010210 is 12010112022012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 210220211010210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6965531995 + ... + 6965562174.
It is an arithmetic number, because the mean of its divisors is an integer number (15797860788780).
Almost surely, 2210220211010210 is an apocalyptic number.
210220211010210 is an abundant number, since it is smaller than the sum of its proper divisors (295311334230750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210220211010210 is a wasteful number, since it uses less digits than its factorization.
210220211010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13931094682.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210220211010210 its reverse (12010112022012), we get a palindrome (222230323032222).
The spelling of 210220211010210 in words is "two hundred ten trillion, two hundred twenty billion, two hundred eleven million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •