Base | Representation |
---|---|
bin | 1101101001011011101010… |
… | …0001000110001010110101 |
3 | 1222010111200121111020001011 |
4 | 3122112322201012022311 |
5 | 3431322130200100000 |
6 | 51525224130032221 |
7 | 3106052016355411 |
oct | 332267241061265 |
9 | 58114617436034 |
10 | 15005450003125 |
11 | 486585937659a |
12 | 18241a6a18671 |
13 | 84b0143795ba |
14 | 39c3a6635d41 |
15 | 1b04d5d5a2ba |
hex | da5ba8462b5 |
15005450003125 has 24 divisors (see below), whose sum is σ = 18773495685000. Its totient is φ = 11992913760000.
The previous prime is 15005450003069. The next prime is 15005450003293. The reversal of 15005450003125 is 52130005450051.
15005450003125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 14995799298481 + 9650704644 = 3872441^2 + 98238^2 .
It is not a de Polignac number, because 15005450003125 - 213 = 15005449994933 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 989401 + ... + 5566849.
It is an arithmetic number, because the mean of its divisors is an integer number (782228986875).
Almost surely, 215005450003125 is an apocalyptic number.
It is an amenable number.
15005450003125 is a deficient number, since it is larger than the sum of its proper divisors (3768045681875).
15005450003125 is an frugal number, since it uses more digits than its factorization.
15005450003125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4578523 (or 4578503 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 31.
Adding to 15005450003125 its reverse (52130005450051), we get a palindrome (67135455453176).
The spelling of 15005450003125 in words is "fifteen trillion, five billion, four hundred fifty million, three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •