Base | Representation |
---|---|
bin | 111011111110000… |
… | …0000101011100011 |
3 | 12012020100101002112 |
4 | 1313330000223203 |
5 | 13110112021011 |
6 | 531400505535 |
7 | 100602405665 |
oct | 16774005343 |
9 | 5166311075 |
10 | 2012220131 |
11 | 942933849 |
12 | 481a7b2ab |
13 | 260b655cc |
14 | 15135a535 |
15 | bb9c858b |
hex | 77f00ae3 |
2012220131 has 8 divisors (see below), whose sum is σ = 2075234304. Its totient is φ = 1949943240.
The previous prime is 2012220121. The next prime is 2012220157. The reversal of 2012220131 is 1310222102.
It is a happy number.
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 2012220131 - 222 = 2008025827 is a prime.
It is a super-2 number, since 2×20122201312 = 8098059711203314322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012220121) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 178775 + ... + 189696.
It is an arithmetic number, because the mean of its divisors is an integer number (259404288).
Almost surely, 22012220131 is an apocalyptic number.
2012220131 is a deficient number, since it is larger than the sum of its proper divisors (63014173).
2012220131 is a wasteful number, since it uses less digits than its factorization.
2012220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368641.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2012220131 is about 44857.7767059403. The cubic root of 2012220131 is about 1262.4819079981.
Adding to 2012220131 its reverse (1310222102), we get a palindrome (3322442233).
The spelling of 2012220131 in words is "two billion, twelve million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •