Base | Representation |
---|---|
bin | 11000110001101000… |
… | …01101000011110111 |
3 | 1021022222122000010120 |
4 | 30120310031003313 |
5 | 204220104140210 |
6 | 10035511423023 |
7 | 650421450345 |
oct | 143064150367 |
9 | 37288560116 |
10 | 13301240055 |
11 | 5706226584 |
12 | 26b2684a73 |
13 | 133c91505c |
14 | 902782995 |
15 | 52cb08270 |
hex | 318d0d0f7 |
13301240055 has 16 divisors (see below), whose sum is σ = 22207288320. Its totient is φ = 6785559968.
The previous prime is 13301240023. The next prime is 13301240081. The reversal of 13301240055 is 55004210331.
13301240055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13301240055 - 25 = 13301240023 is a prime.
It is a super-3 number, since 3×133012400553 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19276815 + ... + 19277504.
It is an arithmetic number, because the mean of its divisors is an integer number (1387955520).
Almost surely, 213301240055 is an apocalyptic number.
13301240055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13301240055 is a deficient number, since it is larger than the sum of its proper divisors (8906048265).
13301240055 is a wasteful number, since it uses less digits than its factorization.
13301240055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38554350.
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 13301240055 its reverse (55004210331), we get a palindrome (68305450386).
The spelling of 13301240055 in words is "thirteen billion, three hundred one million, two hundred forty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •