Base | Representation |
---|---|
bin | 100010101011111010010011… |
… | …111100011011101010000100 |
3 | 202000010202010120121111011222 |
4 | 202223322103330123222010 |
5 | 124443344203402341004 |
6 | 1300241004420415512 |
7 | 44063312140260200 |
oct | 4253722374335204 |
9 | 660122116544158 |
10 | 152551130512004 |
11 | 446756311a0a34 |
12 | 15139520b47598 |
13 | 6717682292783 |
14 | 299572aa21b00 |
15 | 1298311c967be |
hex | 8abe93f1ba84 |
152551130512004 has 36 divisors (see below), whose sum is σ = 324052712028864. Its totient is φ = 62536488282576.
The previous prime is 152551130511991. The next prime is 152551130512009. The reversal of 152551130512004 is 400215031155251.
It is not an unprimeable number, because it can be changed into a prime (152551130512009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16920041024 + ... + 16920050039.
It is an arithmetic number, because the mean of its divisors is an integer number (9001464223024).
Almost surely, 2152551130512004 is an apocalyptic number.
152551130512004 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
152551130512004 is an abundant number, since it is smaller than the sum of its proper divisors (171501581516860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152551130512004 is a wasteful number, since it uses less digits than its factorization.
152551130512004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33840091104 (or 33840091095 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
Adding to 152551130512004 its reverse (400215031155251), we get a palindrome (552766161667255).
The spelling of 152551130512004 in words is "one hundred fifty-two trillion, five hundred fifty-one billion, one hundred thirty million, five hundred twelve thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •