Base | Representation |
---|---|
bin | 110000001101010011000111… |
… | …010101111010111100110010 |
3 | 1000210200220222000020121222220 |
4 | 300031103013111322330302 |
5 | 210242214141130342320 |
6 | 2030532405514541510 |
7 | 62441642655526323 |
oct | 6015230725727462 |
9 | 1023626860217886 |
10 | 212020110012210 |
11 | 61613250826a55 |
12 | 1b942b01a37896 |
13 | 913c545094176 |
14 | 3a4db8436444a |
15 | 197a1e270be40 |
hex | c0d4c757af32 |
212020110012210 has 96 divisors (see below), whose sum is σ = 511011774744768. Its totient is φ = 56299262123520.
The previous prime is 212020110012197. The next prime is 212020110012211. The reversal of 212020110012210 is 12210011020212.
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 212020110012210.
It is not an unprimeable number, because it can be changed into a prime (212020110012211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2853799824 + ... + 2853874116.
It is an arithmetic number, because the mean of its divisors is an integer number (5323039320258).
Almost surely, 2212020110012210 is an apocalyptic number.
212020110012210 is an abundant number, since it is smaller than the sum of its proper divisors (298991664732558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212020110012210 is an equidigital number, since it uses as much as digits as its factorization.
212020110012210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75900 (or 75587 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 212020110012210 its reverse (12210011020212), we get a palindrome (224230121032422).
The spelling of 212020110012210 in words is "two hundred twelve trillion, twenty billion, one hundred ten million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •