Base | Representation |
---|---|
bin | 1100111100100010101001… |
… | …1110010010100011001001 |
3 | 1212101210001020220022020221 |
4 | 3033020222132102203021 |
5 | 3331203202423433223 |
6 | 50135041130550041 |
7 | 2666250410254426 |
oct | 317105236224311 |
9 | 55353036808227 |
10 | 14234234202313 |
11 | 4598783137774 |
12 | 171a834298321 |
13 | 7c338992a868 |
14 | 372d25074d4d |
15 | 19a3e9a84b5d |
hex | cf22a7928c9 |
14234234202313 has 8 divisors (see below), whose sum is σ = 14306384048000. Its totient is φ = 14162090567328.
The previous prime is 14234234202311. The next prime is 14234234202323. The reversal of 14234234202313 is 31320243243241.
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 14234234202313 - 21 = 14234234202311 is a prime.
It is a super-2 number, since 2×142342342023132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14234234202311) 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, 3077620 + ... + 6159562.
It is an arithmetic number, because the mean of its divisors is an integer number (1788298006000).
Almost surely, 214234234202313 is an apocalyptic number.
It is an amenable number.
14234234202313 is a deficient number, since it is larger than the sum of its proper divisors (72149845687).
14234234202313 is a wasteful number, since it uses less digits than its factorization.
14234234202313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3105351.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 14234234202313 its reverse (31320243243241), we get a palindrome (45554477445554).
The spelling of 14234234202313 in words is "fourteen trillion, two hundred thirty-four billion, two hundred thirty-four million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •