Base | Representation |
---|---|
bin | 1101000001000001110100… |
… | …1010100010001101100111 |
3 | 1212200011000112001101102021 |
4 | 3100100131022202031213 |
5 | 3333434041001043421 |
6 | 50234310234124011 |
7 | 3004646600453626 |
oct | 320203512421547 |
9 | 55604015041367 |
10 | 14311320331111 |
11 | 4618440260231 |
12 | 1731768280607 |
13 | 7ca72317601b |
14 | 376958c276bd |
15 | 19c40c324341 |
hex | d041d2a2367 |
14311320331111 has 4 divisors (see below), whose sum is σ = 14407369461000. Its totient is φ = 14215271201224.
The previous prime is 14311320331027. The next prime is 14311320331117. The reversal of 14311320331111 is 11113302311341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14311320331111 - 213 = 14311320322919 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14311320331117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48024564721 + ... + 48024565018.
It is an arithmetic number, because the mean of its divisors is an integer number (3601842365250).
Almost surely, 214311320331111 is an apocalyptic number.
14311320331111 is a deficient number, since it is larger than the sum of its proper divisors (96049129889).
14311320331111 is an equidigital number, since it uses as much as digits as its factorization.
14311320331111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96049129888.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 14311320331111 its reverse (11113302311341), we get a palindrome (25424622642452).
The spelling of 14311320331111 in words is "fourteen trillion, three hundred eleven billion, three hundred twenty million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •