Base | Representation |
---|---|
bin | 1101000001101110100010… |
… | …0101001011001010011101 |
3 | 1212201022000000020100202102 |
4 | 3100123220211023022131 |
5 | 3334133131143232104 |
6 | 50244013241334445 |
7 | 3005553203614505 |
oct | 320335045131235 |
9 | 55638000210672 |
10 | 14323323024029 |
11 | 462253a491058 |
12 | 1733b57a97425 |
13 | 7cb8b6a41496 |
14 | 377376d46a05 |
15 | 19c8b0e27a1e |
hex | d06e894b29d |
14323323024029 has 2 divisors, whose sum is σ = 14323323024030. Its totient is φ = 14323323024028.
The previous prime is 14323323023993. The next prime is 14323323024079. The reversal of 14323323024029 is 92042032332341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11068463224900 + 3254859799129 = 3326930^2 + 1804123^2 .
It is a cyclic number.
It is not a de Polignac number, because 14323323024029 - 28 = 14323323023773 is a prime.
It is a super-2 number, since 2×143233230240292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14323323023983 and 14323323024001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14323323024079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7161661512014 + 7161661512015.
It is an arithmetic number, because the mean of its divisors is an integer number (7161661512015).
Almost surely, 214323323024029 is an apocalyptic number.
It is an amenable number.
14323323024029 is a deficient number, since it is larger than the sum of its proper divisors (1).
14323323024029 is an equidigital number, since it uses as much as digits as its factorization.
14323323024029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 38.
The spelling of 14323323024029 in words is "fourteen trillion, three hundred twenty-three billion, three hundred twenty-three million, twenty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •