Base | Representation |
---|---|
bin | 1000111000010000110… |
… | …0011011101000000000 |
3 | 112120201220010121001200 |
4 | 2032010030123220000 |
5 | 4444401134104002 |
6 | 154024322101200 |
7 | 14010061054011 |
oct | 2160414335000 |
9 | 476656117050 |
10 | 152541706752 |
11 | 597688a9046 |
12 | 25691aaa800 |
13 | 11500022256 |
14 | 755117b008 |
15 | 3e7bce7b1c |
hex | 238431ba00 |
152541706752 has 60 divisors (see below), whose sum is σ = 440245707330. Its totient is φ = 50847234048.
The previous prime is 152541706717. The next prime is 152541706813. The reversal of 152541706752 is 257607145251.
152541706752 is a `hidden beast` number, since 1 + 52 + 541 + 7 + 0 + 6 + 7 + 52 = 666.
It can be written as a sum of positive squares in only one way, i.e., 88480071936 + 64061634816 = 297456^2 + 253104^2 .
It is a junction number, because it is equal to n+sod(n) for n = 152541706698 and 152541706707.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16547227 + ... + 16556442.
Almost surely, 2152541706752 is an apocalyptic number.
152541706752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
152541706752 is an abundant number, since it is smaller than the sum of its proper divisors (287704000578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152541706752 is an equidigital number, since it uses as much as digits as its factorization.
152541706752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33103693 (or 33103674 counting only the distinct ones).
The product of its (nonzero) digits is 588000, while the sum is 45.
The spelling of 152541706752 in words is "one hundred fifty-two billion, five hundred forty-one million, seven hundred six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •