Base | Representation |
---|---|
bin | 100010101011100010010011… |
… | …011000101111011101011000 |
3 | 202000001021120222120110222202 |
4 | 202223202103120233131120 |
5 | 124442433404421232102 |
6 | 1300221102403505332 |
7 | 44061410252110562 |
oct | 4253422330573530 |
9 | 660037528513882 |
10 | 152525351352152 |
11 | 44665702568649 |
12 | 15134527688248 |
13 | 67151044c202c |
14 | 29943a2db6332 |
15 | 12978039b6e02 |
hex | 8ab89362f758 |
152525351352152 has 32 divisors (see below), whose sum is σ = 286444886429520. Its totient is φ = 76140059688960.
The previous prime is 152525351352079. The next prime is 152525351352163. The reversal of 152525351352152 is 251253153525251.
152525351352152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1525253513521522 (a number of 29 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 152525351352097 and 152525351352106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108151448 + ... + 109552664.
Almost surely, 2152525351352152 is an apocalyptic number.
It is an amenable number.
152525351352152 is a deficient number, since it is larger than the sum of its proper divisors (133919535077368).
152525351352152 is a wasteful number, since it uses less digits than its factorization.
152525351352152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1423091 (or 1423087 counting only the distinct ones).
The product of its digits is 2250000, while the sum is 47.
The spelling of 152525351352152 in words is "one hundred fifty-two trillion, five hundred twenty-five billion, three hundred fifty-one million, three hundred fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •