Base | Representation |
---|---|
bin | 11001010010101… |
… | …01001110011001 |
3 | 112210012220202212 |
4 | 30221111032121 |
5 | 413303131213 |
6 | 33015204505 |
7 | 5154225311 |
oct | 1451251631 |
9 | 483186685 |
10 | 212161433 |
11 | a983a030 |
12 | 5b076735 |
13 | 34c54913 |
14 | 2026a441 |
15 | 1395c9a8 |
hex | ca55399 |
212161433 has 8 divisors (see below), whose sum is σ = 234620256. Its totient is φ = 190231200.
The previous prime is 212161423. The next prime is 212161451. The reversal of 212161433 is 334161212.
212161433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212161433 - 226 = 145052569 is a prime.
It is a super-2 number, since 2×2121614332 = 90024947305226978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212161399 and 212161408.
It is not an unprimeable number, because it can be changed into a prime (212161403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131303 + ... + 132908.
It is an arithmetic number, because the mean of its divisors is an integer number (29327532).
Almost surely, 2212161433 is an apocalyptic number.
It is an amenable number.
212161433 is a deficient number, since it is larger than the sum of its proper divisors (22458823).
212161433 is a wasteful number, since it uses less digits than its factorization.
212161433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264295.
The product of its digits is 864, while the sum is 23.
The square root of 212161433 is about 14565.7623556064. The cubic root of 212161433 is about 596.4245066995.
The spelling of 212161433 in words is "two hundred twelve million, one hundred sixty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.516 sec. • engine limits •