Base | Representation |
---|---|
bin | 1100011011010100010101… |
… | …1000110111001100011011 |
3 | 1210101012202200100100220112 |
4 | 3012311011120313030123 |
5 | 3242330224002122021 |
6 | 45020523222114535 |
7 | 2610103104125663 |
oct | 306650530671433 |
9 | 53335680310815 |
10 | 13663455114011 |
11 | 439870322a67a |
12 | 164809b57ba4b |
13 | 7815c5b24961 |
14 | 3534599951a3 |
15 | 18a640249d5b |
hex | c6d4563731b |
13663455114011 has 8 divisors (see below), whose sum is σ = 14370328934784. Its totient is φ = 12973213618560.
The previous prime is 13663455114007. The next prime is 13663455114047. The reversal of 13663455114011 is 11041155436631.
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 13663455114011 - 22 = 13663455114007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13663455114011.
It is not an unprimeable number, because it can be changed into a prime (13663455114061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4158079646 + ... + 4158082931.
It is an arithmetic number, because the mean of its divisors is an integer number (1796291116848).
Almost surely, 213663455114011 is an apocalyptic number.
13663455114011 is a deficient number, since it is larger than the sum of its proper divisors (706873820773).
13663455114011 is an equidigital number, since it uses as much as digits as its factorization.
13663455114011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8316162661.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 13663455114011 in words is "thirteen trillion, six hundred sixty-three billion, four hundred fifty-five million, one hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •