Base | Representation |
---|---|
bin | 1100011011001011111101… |
… | …0101001111000110011010 |
3 | 1210100222221221021101000101 |
4 | 3012302333111033012122 |
5 | 3242311122220011120 |
6 | 45015512120130014 |
7 | 2606663264121061 |
oct | 306627725170632 |
9 | 53328857241011 |
10 | 13661206016410 |
11 | 4397759716327 |
12 | 164777230690a |
13 | 781327b92884 |
14 | 3532c4db71d8 |
15 | 18a55ca8090a |
hex | c6cbf54f19a |
13661206016410 has 8 divisors (see below), whose sum is σ = 24590170829556. Its totient is φ = 5464482406560.
The previous prime is 13661206016407. The next prime is 13661206016413. The reversal of 13661206016410 is 1461060216631.
It is an interprime number because it is at equal distance from previous prime (13661206016407) and next prime (13661206016413).
It can be written as a sum of positive squares in 2 ways, for example, as 13301579119689 + 359626896721 = 3647133^2 + 599689^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13661206016410.
It is not an unprimeable number, because it can be changed into a prime (13661206016413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 683060300811 + ... + 683060300830.
Almost surely, 213661206016410 is an apocalyptic number.
13661206016410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13661206016410 is a deficient number, since it is larger than the sum of its proper divisors (10928964813146).
13661206016410 is a wasteful number, since it uses less digits than its factorization.
13661206016410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1366120601648.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 13661206016410 in words is "thirteen trillion, six hundred sixty-one billion, two hundred six million, sixteen thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •