Base | Representation |
---|---|
bin | 1100101111001001100100… |
… | …1000100110011011011101 |
3 | 1211120210012011111120210002 |
4 | 3023302121020212123131 |
5 | 3313421011103203230 |
6 | 45441231245024045 |
7 | 2643524126440202 |
oct | 313623110463335 |
9 | 54523164446702 |
10 | 14004162553565 |
11 | 450a14a7457a8 |
12 | 16a2125855025 |
13 | 7a778244b4b2 |
14 | 365b3b217ca9 |
15 | 194431582545 |
hex | cbc992266dd |
14004162553565 has 16 divisors (see below), whose sum is σ = 17163457908480. Its totient is φ = 10964380084800.
The previous prime is 14004162553561. The next prime is 14004162553567. The reversal of 14004162553565 is 56535526140041.
It is a happy number.
It is not a de Polignac number, because 14004162553565 - 22 = 14004162553561 is a prime.
It is a super-2 number, since 2×140041625535652 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14004162553561) 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 15 ways as a sum of consecutive naturals, for example, 2890115 + ... + 6030015.
It is an arithmetic number, because the mean of its divisors is an integer number (1072716119280).
Almost surely, 214004162553565 is an apocalyptic number.
It is an amenable number.
14004162553565 is a deficient number, since it is larger than the sum of its proper divisors (3159295354915).
14004162553565 is a wasteful number, since it uses less digits than its factorization.
14004162553565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3158932.
The product of its (nonzero) digits is 2160000, while the sum is 47.
The spelling of 14004162553565 in words is "fourteen trillion, four billion, one hundred sixty-two million, five hundred fifty-three thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •