Base | Representation |
---|---|
bin | 1000001111011101… |
… | …0101111101000010 |
3 | 12201011212122211000 |
4 | 2003313111331002 |
5 | 14012323320023 |
6 | 1003305432430 |
7 | 105552302454 |
oct | 20367257502 |
9 | 5634778730 |
10 | 2212323138 |
11 | a35887133 |
12 | 518a9b716 |
13 | 29345775c |
14 | 16db682d4 |
15 | ce353243 |
hex | 83dd5f42 |
2212323138 has 64 divisors (see below), whose sum is σ = 5021585280. Its totient is φ = 721715904.
The previous prime is 2212323079. The next prime is 2212323143. The reversal of 2212323138 is 8313232122.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1610620 + ... + 1611992.
It is an arithmetic number, because the mean of its divisors is an integer number (78462270).
Almost surely, 22212323138 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2212323138, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2510792640).
2212323138 is an abundant number, since it is smaller than the sum of its proper divisors (2809262142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2212323138 is a wasteful number, since it uses less digits than its factorization.
2212323138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000 (or 1994 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
The square root of 2212323138 is about 47035.3392461456. The cubic root of 2212323138 is about 1303.0153158341.
The spelling of 2212323138 in words is "two billion, two hundred twelve million, three hundred twenty-three thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •