Base | Representation |
---|---|
bin | 101111110010110100000110… |
… | …011011001000100111010000 |
3 | 1000120020221012112110210122202 |
4 | 233302310012123020213100 |
5 | 210022404302131210000 |
6 | 2023020332135222332 |
7 | 62163312325464350 |
oct | 5762640633104720 |
9 | 1016227175423582 |
10 | 210200102210000 |
11 | 60a813a9879441 |
12 | 1b6aa230b179a8 |
13 | 9039a27971c56 |
14 | 39c9a4c63cb60 |
15 | 1947bc13e5dd5 |
hex | bf2d066c89d0 |
210200102210000 has 200 divisors, whose sum is σ = 595143678110784. Its totient is φ = 70392591360000.
The previous prime is 210200102209991. The next prime is 210200102210039. The reversal of 210200102210000 is 12201002012.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (200).
It is a congruent number.
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 39 ways as a sum of consecutive naturals, for example, 31906961 + ... + 37926960.
Almost surely, 2210200102210000 is an apocalyptic number.
210200102210000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210200102210000 is an abundant number, since it is smaller than the sum of its proper divisors (384943575900784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210200102210000 is an equidigital number, since it uses as much as digits as its factorization.
210200102210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69833999 (or 69833978 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 210200102210000 its reverse (12201002012), we get a palindrome (210212303212012).
The spelling of 210200102210000 in words is "two hundred ten trillion, two hundred billion, one hundred two million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •