Base | Representation |
---|---|
bin | 10011111000001111101… |
… | …101001101100100000001 |
3 | 11211121001021202011211212 |
4 | 103320033231031210001 |
5 | 134340144124013101 |
6 | 2523321041215505 |
7 | 200460213564653 |
oct | 23701755154401 |
9 | 4747037664755 |
10 | 1366063110401 |
11 | 4873870158a0 |
12 | 1a0903931595 |
13 | 9ba85a19002 |
14 | 4a1913986d3 |
15 | 25803aca1bb |
hex | 13e0fb4d901 |
1366063110401 has 8 divisors (see below), whose sum is σ = 1577912469984. Its totient is φ = 1168824051520.
The previous prime is 1366063110383. The next prime is 1366063110403. The reversal of 1366063110401 is 1040113606631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1366063110401 - 218 = 1366062848257 is a prime.
It is a super-2 number, since 2×13660631104012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1366063110403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3652574975 + ... + 3652575348.
It is an arithmetic number, because the mean of its divisors is an integer number (197239058748).
Almost surely, 21366063110401 is an apocalyptic number.
1366063110401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1366063110401 is a deficient number, since it is larger than the sum of its proper divisors (211849359583).
1366063110401 is a wasteful number, since it uses less digits than its factorization.
1366063110401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7305150351.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 1366063110401 in words is "one trillion, three hundred sixty-six billion, sixty-three million, one hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •