Base | Representation |
---|---|
bin | 1100110000010000100111… |
… | …1001101100010111101001 |
3 | 1211122121102022102201211211 |
4 | 3030010021321230113221 |
5 | 3314224040442342304 |
6 | 45454103535353121 |
7 | 2645100551111104 |
oct | 314041171542751 |
9 | 54577368381754 |
10 | 14023234340329 |
11 | 4517247222445 |
12 | 16a59689827a1 |
13 | 7a9501731b16 |
14 | 366a2a11b73b |
15 | 194b9aa9c204 |
hex | cc109e6c5e9 |
14023234340329 has 2 divisors, whose sum is σ = 14023234340330. Its totient is φ = 14023234340328.
The previous prime is 14023234340321. The next prime is 14023234340411. The reversal of 14023234340329 is 92304343232041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7294579919104 + 6728654421225 = 2700848^2 + 2593965^2 .
It is a cyclic number.
It is not a de Polignac number, because 14023234340329 - 23 = 14023234340321 is a prime.
It is a super-2 number, since 2×140232343403292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14023234340291 and 14023234340300.
It is not a weakly prime, because it can be changed into another prime (14023234340321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7011617170164 + 7011617170165.
It is an arithmetic number, because the mean of its divisors is an integer number (7011617170165).
Almost surely, 214023234340329 is an apocalyptic number.
It is an amenable number.
14023234340329 is a deficient number, since it is larger than the sum of its proper divisors (1).
14023234340329 is an equidigital number, since it uses as much as digits as its factorization.
14023234340329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 40.
The spelling of 14023234340329 in words is "fourteen trillion, twenty-three billion, two hundred thirty-four million, three hundred forty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •