Base | Representation |
---|---|
bin | 1100111100100010001101… |
… | …0011110101001010111111 |
3 | 1212101202201212202102011022 |
4 | 3033020203103311022333 |
5 | 3331202431142120111 |
6 | 50135021155014355 |
7 | 2666244420603653 |
oct | 317104323651277 |
9 | 55352655672138 |
10 | 14234114020031 |
11 | 4598721310a74 |
12 | 171a7bbb9a3bb |
13 | 7c336aa6b999 |
14 | 372d1310ca63 |
15 | 19a3de2452db |
hex | cf2234f52bf |
14234114020031 has 8 divisors (see below), whose sum is σ = 14373624305664. Its totient is φ = 14095032338520.
The previous prime is 14234114019971. The next prime is 14234114020073. The reversal of 14234114020031 is 13002041143241.
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 14234114020031 - 210 = 14234114019007 is a prime.
It is a super-2 number, since 2×142341140200312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14234114920031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107084285 + ... + 107217126.
It is an arithmetic number, because the mean of its divisors is an integer number (1796703038208).
Almost surely, 214234114020031 is an apocalyptic number.
14234114020031 is a deficient number, since it is larger than the sum of its proper divisors (139510285633).
14234114020031 is a wasteful number, since it uses less digits than its factorization.
14234114020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214302061.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 14234114020031 its reverse (13002041143241), we get a palindrome (27236155163272).
The spelling of 14234114020031 in words is "fourteen trillion, two hundred thirty-four billion, one hundred fourteen million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •