Base | Representation |
---|---|
bin | 110000010000000011111101… |
… | …101011000111101010100000 |
3 | 1000211101002002202221120011100 |
4 | 300100003331223013222200 |
5 | 210303322040011200000 |
6 | 2031155532254314400 |
7 | 62461444425613530 |
oct | 6020037553075240 |
9 | 1024332082846140 |
10 | 212210000100000 |
11 | 61686834831501 |
12 | 1b9738777b8a00 |
13 | 91544179c1766 |
14 | 3a590398714c0 |
15 | 1980108311a00 |
hex | c100fdac7aa0 |
212210000100000 has 432 divisors, whose sum is σ = 862047976398336. Its totient is φ = 48505141440000.
The previous prime is 212210000099953. The next prime is 212210000100013. The reversal of 212210000100000 is 1000012212.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 10542064 + ... + 23142063.
It is an arithmetic number, because the mean of its divisors is an integer number (1995481426848).
Almost surely, 2212210000100000 is an apocalyptic number.
212210000100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212210000100000 is an abundant number, since it is smaller than the sum of its proper divisors (649837976298336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212210000100000 is an equidigital number, since it uses as much as digits as its factorization.
212210000100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33684175 (or 33684144 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 212210000100000 its reverse (1000012212), we get a palindrome (212211000112212).
The spelling of 212210000100000 in words is "two hundred twelve trillion, two hundred ten billion, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •