Base | Representation |
---|---|
bin | 110000001110011101100111… |
… | …000111101101110011000100 |
3 | 1000210222120102122121210012010 |
4 | 300032131213013231303010 |
5 | 210300022001103213322 |
6 | 2031033235115054220 |
7 | 62450504126625006 |
oct | 6016354707556304 |
9 | 1023876378553163 |
10 | 212100100054212 |
11 | 61644169051487 |
12 | 1b956506441370 |
13 | 9146c52120576 |
14 | 3a539b1a6a376 |
15 | 197c324db020c |
hex | c0e7671edcc4 |
212100100054212 has 96 divisors (see below), whose sum is σ = 522912406804480. Its totient is φ = 66726402963840.
The previous prime is 212100100054201. The next prime is 212100100054217. The reversal of 212100100054212 is 212450001001212.
It is not an unprimeable number, because it can be changed into a prime (212100100054217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 797364738 + ... + 797630694.
Almost surely, 2212100100054212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212100100054212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261456203402240).
212100100054212 is an abundant number, since it is smaller than the sum of its proper divisors (310812306750268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100100054212 is a wasteful number, since it uses less digits than its factorization.
212100100054212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279161 (or 279159 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 212100100054212 its reverse (212450001001212), we get a palindrome (424550101055424).
The spelling of 212100100054212 in words is "two hundred twelve trillion, one hundred billion, one hundred million, fifty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •