Base | Representation |
---|---|
bin | 1011111101101010000110… |
… | …1101000110011100011000 |
3 | 1201120111112002210120211202 |
4 | 2333122201231012130120 |
5 | 3211003143110040000 |
6 | 43550453004013332 |
7 | 2525223655060133 |
oct | 277324155063430 |
9 | 51514462716752 |
10 | 13153902815000 |
11 | 42115a2243592 |
12 | 1585393531248 |
13 | 74553b98cb5c |
14 | 33691bc6d21a |
15 | 17c26abe0dd5 |
hex | bf6a1b46718 |
13153902815000 has 80 divisors (see below), whose sum is σ = 30902224935120. Its totient is φ = 5247454320000.
The previous prime is 13153902814999. The next prime is 13153902815099. The reversal of 13153902815000 is 51820935131.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1661516 + ... + 5391515.
It is an arithmetic number, because the mean of its divisors is an integer number (386277811689).
Almost surely, 213153902815000 is an apocalyptic number.
13153902815000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13153902815000 is an abundant number, since it is smaller than the sum of its proper divisors (17748322120120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13153902815000 is an equidigital number, since it uses as much as digits as its factorization.
13153902815000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7053430 (or 7053411 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 13153902815000 in words is "thirteen trillion, one hundred fifty-three billion, nine hundred two million, eight hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •