Base | Representation |
---|---|
bin | 1100010110001000110… |
… | …1011111011010110000 |
3 | 202021110200122022122221 |
4 | 3011202031133122300 |
5 | 11433340340214412 |
6 | 241234330410424 |
7 | 21216030420346 |
oct | 3054215373260 |
9 | 667420568587 |
10 | 212101101232 |
11 | 81a515a6709 |
12 | 35134290a14 |
13 | 170023c17c7 |
14 | a3a12d9996 |
15 | 57b5a15b07 |
hex | 316235f6b0 |
212101101232 has 10 divisors (see below), whose sum is σ = 410945883668. Its totient is φ = 106050550608.
The previous prime is 212101101209. The next prime is 212101101241. The reversal of 212101101232 is 232101101212.
212101101232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2121011012322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 13256318827 = 212101101232 / (2 + 1 + 2 + 1 + 0 + 1 + 1 + 0 + 1 + 2 + 3 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6628159398 + ... + 6628159429.
Almost surely, 2212101101232 is an apocalyptic number.
It is an amenable number.
212101101232 is a deficient number, since it is larger than the sum of its proper divisors (198844782436).
212101101232 is a wasteful number, since it uses less digits than its factorization.
212101101232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13256318835 (or 13256318829 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 212101101232 its reverse (232101101212), we get a palindrome (444202202444).
The spelling of 212101101232 in words is "two hundred twelve billion, one hundred one million, one hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •