Base | Representation |
---|---|
bin | 11001010011000… |
… | …01100110111000 |
3 | 112210022111100100 |
4 | 30221201212320 |
5 | 413311242102 |
6 | 33020235400 |
7 | 5154526215 |
oct | 1451414670 |
9 | 483274310 |
10 | 212212152 |
11 | a9874149 |
12 | 5b09bb60 |
13 | 34c71a29 |
14 | 20280b0c |
15 | 1396ca1c |
hex | ca619b8 |
212212152 has 48 divisors (see below), whose sum is σ = 577362240. Its totient is φ = 70414848.
The previous prime is 212212151. The next prime is 212212177. The reversal of 212212152 is 251212212.
It is a super-2 number, since 2×2122121522 = 90067994912942208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212212151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9448 + ... + 22664.
It is an arithmetic number, because the mean of its divisors is an integer number (12028380).
Almost surely, 2212212152 is an apocalyptic number.
It is an amenable number.
212212152 is an abundant number, since it is smaller than the sum of its proper divisors (365150088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212212152 is a wasteful number, since it uses less digits than its factorization.
212212152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13452 (or 13445 counting only the distinct ones).
The product of its digits is 160, while the sum is 18.
The square root of 212212152 is about 14567.5032864249. The cubic root of 212212152 is about 596.4720297011.
Adding to 212212152 its reverse (251212212), we get a palindrome (463424364).
The spelling of 212212152 in words is "two hundred twelve million, two hundred twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •