Base | Representation |
---|---|
bin | 1000101110011110110… |
… | …0010110110001001000 |
3 | 112022221220111112121211 |
4 | 2023213230112301020 |
5 | 4424012002140202 |
6 | 152512005142504 |
7 | 13555026264340 |
oct | 2134754266110 |
9 | 468856445554 |
10 | 149916052552 |
11 | 586407811a2 |
12 | 2507a6baa34 |
13 | 111a2069406 |
14 | 738257bd20 |
15 | 3d7654b1d7 |
hex | 22e7b16c48 |
149916052552 has 64 divisors (see below), whose sum is σ = 324556525440. Its totient is φ = 63588672000.
The previous prime is 149916052549. The next prime is 149916052577. The reversal of 149916052552 is 255250619941.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 149916052496 and 149916052505.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25488652 + ... + 25494532.
It is an arithmetic number, because the mean of its divisors is an integer number (5071195710).
Almost surely, 2149916052552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 149916052552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162278262720).
149916052552 is an abundant number, since it is smaller than the sum of its proper divisors (174640472888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149916052552 is a wasteful number, since it uses less digits than its factorization.
149916052552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10502 (or 10498 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 49.
The spelling of 149916052552 in words is "one hundred forty-nine billion, nine hundred sixteen million, fifty-two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •