Base | Representation |
---|---|
bin | 1000110011011100000… |
… | …1101110000000000000 |
3 | 112110101200000100201022 |
4 | 2030313001232000000 |
5 | 4434223221142200 |
6 | 153252033125012 |
7 | 13633020510464 |
oct | 2146701560000 |
9 | 473350010638 |
10 | 151247052800 |
11 | 591640223a8 |
12 | 253903b9768 |
13 | 11354a3971c |
14 | 746b24c4a4 |
15 | 3e03311885 |
hex | 233706e000 |
151247052800 has 336 divisors, whose sum is σ = 403698090240. Its totient is φ = 56027381760.
The previous prime is 151247052763. The next prime is 151247052811. The reversal of 151247052800 is 8250742151.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 182885987 + ... + 182886813.
Almost surely, 2151247052800 is an apocalyptic number.
151247052800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 151247052800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (201849045120).
151247052800 is an abundant number, since it is smaller than the sum of its proper divisors (252451037440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151247052800 is an equidigital number, since it uses as much as digits as its factorization.
151247052800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929 (or 900 counting only the distinct ones).
The product of its (nonzero) digits is 22400, while the sum is 35.
Adding to 151247052800 its reverse (8250742151), we get a palindrome (159497794951).
The spelling of 151247052800 in words is "one hundred fifty-one billion, two hundred forty-seven million, fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •