Base | Representation |
---|---|
bin | 1100000101000000101001… |
… | …0001001101010010000000 |
3 | 1202000120112202020102220120 |
4 | 3001100022101031102000 |
5 | 3220040333024142430 |
6 | 44124502250140240 |
7 | 2540315004234351 |
oct | 301201221152200 |
9 | 52016482212816 |
10 | 13280211162240 |
11 | 4260118a94320 |
12 | 15a5963a21680 |
13 | 75441aaa4269 |
14 | 33caa0d2bd28 |
15 | 1806ae8db610 |
hex | c140a44d480 |
13280211162240 has 128 divisors (see below), whose sum is σ = 46178916160320. Its totient is φ = 3219445125120.
The previous prime is 13280211162109. The next prime is 13280211162247. The reversal of 13280211162240 is 4226111208231.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (13280211162247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 314377819 + ... + 314420058.
Almost surely, 213280211162240 is an apocalyptic number.
13280211162240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13280211162240 is an abundant number, since it is smaller than the sum of its proper divisors (32898704998080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13280211162240 is a wasteful number, since it uses less digits than its factorization.
13280211162240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628797910 (or 628797898 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 33.
The spelling of 13280211162240 in words is "thirteen trillion, two hundred eighty billion, two hundred eleven million, one hundred sixty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •