Base | Representation |
---|---|
bin | 11101110100110010… |
… | …01110000001110010 |
3 | 1112022220112200202100 |
4 | 32322121032001302 |
5 | 230243042400442 |
6 | 11204510201230 |
7 | 1104536251521 |
oct | 167231160162 |
9 | 45286480670 |
10 | 16012075122 |
11 | 687744303a |
12 | 312a4b3216 |
13 | 1682423484 |
14 | abc7d64b8 |
15 | 63aacd84c |
hex | 3ba64e072 |
16012075122 has 12 divisors (see below), whose sum is σ = 34692829470. Its totient is φ = 5337358368.
The previous prime is 16012075099. The next prime is 16012075127. The reversal of 16012075122 is 22157021061.
16012075122 is a `hidden beast` number, since 1 + 601 + 2 + 0 + 7 + 51 + 2 + 2 = 666.
16012075122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 8917213761 + 7094861361 = 94431^2 + 84231^2 .
It is not an unprimeable number, because it can be changed into a prime (16012075127) 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 5 ways as a sum of consecutive naturals, for example, 444779847 + ... + 444779882.
Almost surely, 216012075122 is an apocalyptic number.
16012075122 is an abundant number, since it is smaller than the sum of its proper divisors (18680754348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16012075122 is a wasteful number, since it uses less digits than its factorization.
16012075122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889559737 (or 889559734 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
Adding to 16012075122 its reverse (22157021061), we get a palindrome (38169096183).
The spelling of 16012075122 in words is "sixteen billion, twelve million, seventy-five thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •