Base | Representation |
---|---|
bin | 1100001100010101110011… |
… | …1000110110101111010000 |
3 | 1202110121121201220021222012 |
4 | 3003011130320312233100 |
5 | 3224121244220321320 |
6 | 44302411221202052 |
7 | 2552363633125262 |
oct | 303053470665720 |
9 | 52417551807865 |
10 | 13406151338960 |
11 | 42a9575a2a0a6 |
12 | 1606250b60328 |
13 | 76326b83c9a3 |
14 | 344c0b14db32 |
15 | 183ad110e4c5 |
hex | c315ce36bd0 |
13406151338960 has 80 divisors (see below), whose sum is σ = 31265920567296. Its totient is φ = 5345859339264.
The previous prime is 13406151338959. The next prime is 13406151338999. The reversal of 13406151338960 is 6983315160431.
13406151338960 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 13406151338899 and 13406151338908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40159457 + ... + 40491903.
Almost surely, 213406151338960 is an apocalyptic number.
13406151338960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13406151338960 is an abundant number, since it is smaller than the sum of its proper divisors (17859769228336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13406151338960 is a wasteful number, since it uses less digits than its factorization.
13406151338960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334020 (or 334014 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 13406151338960 in words is "thirteen trillion, four hundred six billion, one hundred fifty-one million, three hundred thirty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •