Base | Representation |
---|---|
bin | 1100111100100001111001… |
… | …1100100001011010010111 |
3 | 1212101202112012012022102011 |
4 | 3033020132130201122113 |
5 | 3331202244244143221 |
6 | 50135005121525051 |
7 | 2666242410133405 |
oct | 317103634413227 |
9 | 55352465168364 |
10 | 14234032412311 |
11 | 459868a241978 |
12 | 171a7987a3787 |
13 | 7c3356b978aa |
14 | 372d06348475 |
15 | 19a3d6ec51e1 |
hex | cf21e721697 |
14234032412311 has 16 divisors (see below), whose sum is σ = 14744733622528. Its totient is φ = 13726596441600.
The previous prime is 14234032412309. The next prime is 14234032412329. The reversal of 14234032412311 is 11321423043241.
It is a happy number.
It is not a de Polignac number, because 14234032412311 - 21 = 14234032412309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14234032413311) 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, 19075801 + ... + 19807933.
It is an arithmetic number, because the mean of its divisors is an integer number (921545851408).
Almost surely, 214234032412311 is an apocalyptic number.
14234032412311 is a deficient number, since it is larger than the sum of its proper divisors (510701210217).
14234032412311 is a wasteful number, since it uses less digits than its factorization.
14234032412311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 734362.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 14234032412311 its reverse (11321423043241), we get a palindrome (25555455455552).
The spelling of 14234032412311 in words is "fourteen trillion, two hundred thirty-four billion, thirty-two million, four hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •