Base | Representation |
---|---|
bin | 1101000101101010001100… |
… | …0010111001001101000001 |
3 | 1212221202100212212022220001 |
4 | 3101122203002321031001 |
5 | 3341240003211331101 |
6 | 50335024353520001 |
7 | 3013464214514230 |
oct | 321324302711501 |
9 | 55852325768801 |
10 | 14390875886401 |
11 | 46491552a5433 |
12 | 174506b273001 |
13 | 8050911a78b1 |
14 | 37a74494cb17 |
15 | 19e5167a0901 |
hex | d16a30b9341 |
14390875886401 has 4 divisors (see below), whose sum is σ = 16446715298752. Its totient is φ = 12335036474052.
The previous prime is 14390875886389. The next prime is 14390875886407. The reversal of 14390875886401 is 10468857809341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14390875886401 - 225 = 14390842331969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14390875886407) 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, 1027919706165 + ... + 1027919706178.
It is an arithmetic number, because the mean of its divisors is an integer number (4111678824688).
Almost surely, 214390875886401 is an apocalyptic number.
It is an amenable number.
14390875886401 is a deficient number, since it is larger than the sum of its proper divisors (2055839412351).
14390875886401 is an equidigital number, since it uses as much as digits as its factorization.
14390875886401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055839412350.
The product of its (nonzero) digits is 46448640, while the sum is 64.
The spelling of 14390875886401 in words is "fourteen trillion, three hundred ninety billion, eight hundred seventy-five million, eight hundred eighty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •