Base | Representation |
---|---|
bin | 1101000100000111011011… |
… | …1000011011101101011001 |
3 | 1212212012221022020000120010 |
4 | 3101001312320123231121 |
5 | 3340321204434032443 |
6 | 50314522004352133 |
7 | 3011535234100614 |
oct | 321016670335531 |
9 | 55765838200503 |
10 | 14364365142873 |
11 | 4638990710439 |
12 | 173bab09a5649 |
13 | 802727989cc5 |
14 | 37934baa717b |
15 | 19d9b4160733 |
hex | d1076e1bb59 |
14364365142873 has 16 divisors (see below), whose sum is σ = 19159521429056. Its totient is φ = 9572726473920.
The previous prime is 14364365142859. The next prime is 14364365142887. The reversal of 14364365142873 is 37824156346341.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (14364365142859) and next prime (14364365142887).
It is not a de Polignac number, because 14364365142873 - 212 = 14364365138777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (14364365142073) 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, 294405786 + ... + 294454572.
It is an arithmetic number, because the mean of its divisors is an integer number (1197470089316).
Almost surely, 214364365142873 is an apocalyptic number.
It is an amenable number.
14364365142873 is a deficient number, since it is larger than the sum of its proper divisors (4795156286183).
14364365142873 is a wasteful number, since it uses less digits than its factorization.
14364365142873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82824.
The product of its digits is 34836480, while the sum is 57.
The spelling of 14364365142873 in words is "fourteen trillion, three hundred sixty-four billion, three hundred sixty-five million, one hundred forty-two thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •