Base | Representation |
---|---|
bin | 111011111110000… |
… | …0001011010110100 |
3 | 12012020100112020120 |
4 | 1313330001122310 |
5 | 13110112120111 |
6 | 531400531540 |
7 | 100602420546 |
oct | 16774013264 |
9 | 5166315216 |
10 | 2012223156 |
11 | 942936049 |
12 | 481a80bb0 |
13 | 260b66ab8 |
14 | 15135b696 |
15 | bb9c9406 |
hex | 77f016b4 |
2012223156 has 48 divisors (see below), whose sum is σ = 5003119296. Its totient is φ = 627254784.
The previous prime is 2012223137. The next prime is 2012223209. The reversal of 2012223156 is 6513222102.
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 615 + ... + 63441.
It is an arithmetic number, because the mean of its divisors is an integer number (104231652).
Almost surely, 22012223156 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 2012223156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2501559648).
2012223156 is an abundant number, since it is smaller than the sum of its proper divisors (2990896140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012223156 is a wasteful number, since it uses less digits than its factorization.
2012223156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63008 (or 63006 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 2012223156 is about 44857.8104236040. The cubic root of 2012223156 is about 1262.4825406336.
Adding to 2012223156 its reverse (6513222102), we get a palindrome (8525445258).
The spelling of 2012223156 in words is "two billion, twelve million, two hundred twenty-three thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •