Base | Representation |
---|---|
bin | 1100011011001010000010… |
… | …0111010001100101001010 |
3 | 1210100221122000112010012212 |
4 | 3012302200213101211022 |
5 | 3242304043301321331 |
6 | 45015345030105122 |
7 | 2606644435441265 |
oct | 306624047214512 |
9 | 53327560463185 |
10 | 13660690651466 |
11 | 4397514814a91 |
12 | 16476497ab1a2 |
13 | 78127518acc1 |
14 | 353276781cdc |
15 | 18a52c6ced2b |
hex | c6ca09d194a |
13660690651466 has 8 divisors (see below), whose sum is σ = 20491967326944. Its totient is φ = 6830034875820.
The previous prime is 13660690651463. The next prime is 13660690651471. The reversal of 13660690651466 is 66415609606631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-5 number, since 5×136606906514665 (a number of 67 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13660690651463) 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 3 ways as a sum of consecutive naturals, for example, 155169950 + ... + 155257961.
It is an arithmetic number, because the mean of its divisors is an integer number (2561495915868).
Almost surely, 213660690651466 is an apocalyptic number.
13660690651466 is a deficient number, since it is larger than the sum of its proper divisors (6831276675478).
13660690651466 is a wasteful number, since it uses less digits than its factorization.
13660690651466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310449916.
The product of its (nonzero) digits is 25194240, while the sum is 59.
The spelling of 13660690651466 in words is "thirteen trillion, six hundred sixty billion, six hundred ninety million, six hundred fifty-one thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •