Base | Representation |
---|---|
bin | 1100000110100001100111… |
… | …1001010111011000000100 |
3 | 1202010001201222000111122220 |
4 | 3001220121321113120010 |
5 | 3221002141221320424 |
6 | 44144445334052340 |
7 | 2542226052421362 |
oct | 301503171273004 |
9 | 52101658014586 |
10 | 13306243151364 |
11 | 4270167403019 |
12 | 15aaa09aaa0b0 |
13 | 756a09068117 |
14 | 34005038c632 |
15 | 1811d4ead579 |
hex | c1a19e57604 |
13306243151364 has 192 divisors, whose sum is σ = 33533423616000. Its totient is φ = 4098304304640.
The previous prime is 13306243151351. The next prime is 13306243151371. The reversal of 13306243151364 is 46315134260331.
It is a super-2 number, since 2×133062431513642 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 641285262 + ... + 641306010.
It is an arithmetic number, because the mean of its divisors is an integer number (174653248000).
Almost surely, 213306243151364 is an apocalyptic number.
It is an amenable number.
13306243151364 is an abundant number, since it is smaller than the sum of its proper divisors (20227180464636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13306243151364 is a wasteful number, since it uses less digits than its factorization.
13306243151364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21730 (or 21728 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 42.
The spelling of 13306243151364 in words is "thirteen trillion, three hundred six billion, two hundred forty-three million, one hundred fifty-one thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •