Base | Representation |
---|---|
bin | 1000111000001100010… |
… | …1101010101001010011 |
3 | 112120200121020010021200 |
4 | 2032003011222221103 |
5 | 4444331411443201 |
6 | 154022420322243 |
7 | 14006444302230 |
oct | 2160305525123 |
9 | 476617203250 |
10 | 152523156051 |
11 | 59759388692 |
12 | 25687843383 |
13 | 114c92286c6 |
14 | 754c90c787 |
15 | 3e7a381386 |
hex | 238316aa53 |
152523156051 has 48 divisors (see below), whose sum is σ = 270675225600. Its totient is φ = 80812111104.
The previous prime is 152523156007. The next prime is 152523156067. The reversal of 152523156051 is 150651325251.
152523156051 is a `hidden beast` number, since 1 + 5 + 25 + 23 + 1 + 5 + 605 + 1 = 666.
It is not a de Polignac number, because 152523156051 - 210 = 152523155027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152523155997 and 152523156015.
It is not an unprimeable number, because it can be changed into a prime (152523156251) 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 47 ways as a sum of consecutive naturals, for example, 1299286 + ... + 1411803.
It is an arithmetic number, because the mean of its divisors is an integer number (5639067200).
Almost surely, 2152523156051 is an apocalyptic number.
152523156051 is a deficient number, since it is larger than the sum of its proper divisors (118152069549).
152523156051 is a wasteful number, since it uses less digits than its factorization.
152523156051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711168 (or 2711165 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 152523156051 in words is "one hundred fifty-two billion, five hundred twenty-three million, one hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •