Base | Representation |
---|---|
bin | 11001001101101000… |
… | …01101011010000000 |
3 | 1021221100121021021020 |
4 | 30212310031122000 |
5 | 210210221404441 |
6 | 10115102025440 |
7 | 656303066661 |
oct | 144664153200 |
9 | 37840537236 |
10 | 13536122496 |
11 | 58168741a6 |
12 | 2759278280 |
13 | 1379493750 |
14 | 925a45368 |
15 | 543552e66 |
hex | 326d0d680 |
13536122496 has 128 divisors (see below), whose sum is σ = 39157473600. Its totient is φ = 4118028288.
The previous prime is 13536122477. The next prime is 13536122497. The reversal of 13536122496 is 69422163531.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×135361224962 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13536122497) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429055 + ... + 459521.
Almost surely, 213536122496 is an apocalyptic number.
13536122496 is a gapful number since it is divisible by the number (16) 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 13536122496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19578736800).
13536122496 is an abundant number, since it is smaller than the sum of its proper divisors (25621351104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13536122496 is a wasteful number, since it uses less digits than its factorization.
13536122496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30586 (or 30574 counting only the distinct ones).
The product of its digits is 233280, while the sum is 42.
The spelling of 13536122496 in words is "thirteen billion, five hundred thirty-six million, one hundred twenty-two thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •