Base | Representation |
---|---|
bin | 1001011011100010110… |
… | …0000111111101000100 |
3 | 120111011220211212021121 |
4 | 2112320230013331010 |
5 | 10123300131131422 |
6 | 202232155123324 |
7 | 14463550243300 |
oct | 2267054077504 |
9 | 514156755247 |
10 | 162012364612 |
11 | 6278883550a |
12 | 27495743544 |
13 | 1237c152c07 |
14 | 7baccaad00 |
15 | 43334938c7 |
hex | 25b8b07f44 |
162012364612 has 36 divisors (see below), whose sum is σ = 330390745020. Its totient is φ = 69311794944.
The previous prime is 162012364571. The next prime is 162012364639. The reversal of 162012364612 is 216463210261.
162012364612 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 2 ways, for example, as 45618125056 + 116394239556 = 213584^2 + 341166^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 614833 + ... + 837880.
It is an arithmetic number, because the mean of its divisors is an integer number (9177520695).
Almost surely, 2162012364612 is an apocalyptic number.
It is an amenable number.
162012364612 is an abundant number, since it is smaller than the sum of its proper divisors (168378380408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
162012364612 is a wasteful number, since it uses less digits than its factorization.
162012364612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1453300 (or 1453291 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 34.
Adding to 162012364612 its reverse (216463210261), we get a palindrome (378475574873).
The spelling of 162012364612 in words is "one hundred sixty-two billion, twelve million, three hundred sixty-four thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •