Base | Representation |
---|---|
bin | 1011110110110110001101… |
… | …0000100101011110010100 |
3 | 1201011022111100111022022010 |
4 | 2331231203100211132110 |
5 | 3202044023101114130 |
6 | 43421022015304220 |
7 | 2513612212260021 |
oct | 275554320453624 |
9 | 51138440438263 |
10 | 13036891035540 |
11 | 4176a07133819 |
12 | 156677851b070 |
13 | 7374b18c4528 |
14 | 330dbb744548 |
15 | 1791bd2540b0 |
hex | bdb63425794 |
13036891035540 has 24 divisors (see below), whose sum is σ = 36503294899680. Its totient is φ = 3476504276128.
The previous prime is 13036891035521. The next prime is 13036891035551. The reversal of 13036891035540 is 4553019863031.
It is a self number, because there is not a number n which added to its sum of digits gives 13036891035540.
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 7 ways as a sum of consecutive naturals, for example, 108640758570 + ... + 108640758689.
It is an arithmetic number, because the mean of its divisors is an integer number (1520970620820).
Almost surely, 213036891035540 is an apocalyptic number.
13036891035540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13036891035540 is an abundant number, since it is smaller than the sum of its proper divisors (23466403864140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13036891035540 is a wasteful number, since it uses less digits than its factorization.
13036891035540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217281517271 (or 217281517269 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 13036891035540 in words is "thirteen trillion, thirty-six billion, eight hundred ninety-one million, thirty-five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •