Base | Representation |
---|---|
bin | 1000110111000010110… |
… | …0000100011011101010 |
3 | 112112220002100112111000 |
4 | 2031300230010123222 |
5 | 4443213400043132 |
6 | 153532032015430 |
7 | 13666005346215 |
oct | 2156054043352 |
9 | 475802315430 |
10 | 152214456042 |
11 | 59610101810 |
12 | 25600391576 |
13 | 1147a2a298c |
14 | 751d91277c |
15 | 3e5d20487c |
hex | 2370b046ea |
152214456042 has 32 divisors (see below), whose sum is σ = 369004743360. Its totient is φ = 46125592560.
The previous prime is 152214456013. The next prime is 152214456049. The reversal of 152214456042 is 240654412251.
152214456042 is a `hidden beast` number, since 1 + 5 + 2 + 2 + 1 + 4 + 45 + 604 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 152214455988 and 152214456006.
It is not an unprimeable number, because it can be changed into a prime (152214456049) 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 15 ways as a sum of consecutive naturals, for example, 128126053 + ... + 128127240.
It is an arithmetic number, because the mean of its divisors is an integer number (11531398230).
Almost surely, 2152214456042 is an apocalyptic number.
152214456042 is an abundant number, since it is smaller than the sum of its proper divisors (216790287318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152214456042 is a wasteful number, since it uses less digits than its factorization.
152214456042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256253315 (or 256253309 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 36.
Adding to 152214456042 its reverse (240654412251), we get a palindrome (392868868293).
The spelling of 152214456042 in words is "one hundred fifty-two billion, two hundred fourteen million, four hundred fifty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •