Base | Representation |
---|---|
bin | 1100001100011011011101… |
… | …0010101110100000000001 |
3 | 1202110202112102220020100202 |
4 | 3003012313102232200001 |
5 | 3224132401011223101 |
6 | 44303221522054545 |
7 | 2552446341126653 |
oct | 303066722564001 |
9 | 52422472806322 |
10 | 13407668070401 |
11 | 42aa1840a7960 |
12 | 16065b4aaa455 |
13 | 763450b3c707 |
14 | 344d1276a6d3 |
15 | 183b6e36136b |
hex | c31b74ae801 |
13407668070401 has 8 divisors (see below), whose sum is σ = 14668698422304. Its totient is φ = 12153662957920.
The previous prime is 13407668070397. The next prime is 13407668070403. The reversal of 13407668070401 is 10407086670431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13407668070401 - 22 = 13407668070397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13407668070403) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1756305860 + ... + 1756313493.
It is an arithmetic number, because the mean of its divisors is an integer number (1833587302788).
Almost surely, 213407668070401 is an apocalyptic number.
13407668070401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13407668070401 is a deficient number, since it is larger than the sum of its proper divisors (1261030351903).
13407668070401 is a wasteful number, since it uses less digits than its factorization.
13407668070401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3512619711.
The product of its (nonzero) digits is 677376, while the sum is 47.
The spelling of 13407668070401 in words is "thirteen trillion, four hundred seven billion, six hundred sixty-eight million, seventy thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •