Base | Representation |
---|---|
bin | 1100110000111001110110… |
… | …0110100110111111001111 |
3 | 1211200122222122202100101012 |
4 | 3030032131212212333033 |
5 | 3314414222342100421 |
6 | 45503134112235435 |
7 | 2645642044162322 |
oct | 314163546467717 |
9 | 54618878670335 |
10 | 14034302300111 |
11 | 4520a06858445 |
12 | 16a7b3753bb7b |
13 | 7aa576762452 |
14 | 36739a03c7b9 |
15 | 1950e75b295b |
hex | cc39d9a6fcf |
14034302300111 has 4 divisors (see below), whose sum is σ = 14170557662352. Its totient is φ = 13898046937872.
The previous prime is 14034302300089. The next prime is 14034302300113. The reversal of 14034302300111 is 11100320343041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14034302300111 is a prime.
It is a super-2 number, since 2×140343023001112 (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 (14034302300113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68127680966 + ... + 68127681171.
It is an arithmetic number, because the mean of its divisors is an integer number (3542639415588).
Almost surely, 214034302300111 is an apocalyptic number.
14034302300111 is a deficient number, since it is larger than the sum of its proper divisors (136255362241).
14034302300111 is a wasteful number, since it uses less digits than its factorization.
14034302300111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136255362240.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 14034302300111 its reverse (11100320343041), we get a palindrome (25134622643152).
The spelling of 14034302300111 in words is "fourteen trillion, thirty-four billion, three hundred two million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •