Base | Representation |
---|---|
bin | 1100111010101011101111… |
… | …0000110101110101111111 |
3 | 1212021201122112200121011002 |
4 | 3032222323300311311333 |
5 | 3330142313334222143 |
6 | 50112241351520515 |
7 | 2664040350233456 |
oct | 316527360656577 |
9 | 55251575617132 |
10 | 14202312023423 |
11 | 458619197a247 |
12 | 171460568913b |
13 | 7c0370267b04 |
14 | 37157762bb9d |
15 | 19967c31b5b8 |
hex | ceabbc35d7f |
14202312023423 has 4 divisors (see below), whose sum is σ = 14207574090600. Its totient is φ = 14197049956248.
The previous prime is 14202312023413. The next prime is 14202312023429. The reversal of 14202312023423 is 32432021320241.
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 14202312023423 - 210 = 14202312022399 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 (14202312023429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2631029540 + ... + 2631034937.
It is an arithmetic number, because the mean of its divisors is an integer number (3551893522650).
Almost surely, 214202312023423 is an apocalyptic number.
14202312023423 is a deficient number, since it is larger than the sum of its proper divisors (5262067177).
14202312023423 is an equidigital number, since it uses as much as digits as its factorization.
14202312023423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5262067176.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 14202312023423 its reverse (32432021320241), we get a palindrome (46634333343664).
The spelling of 14202312023423 in words is "fourteen trillion, two hundred two billion, three hundred twelve million, twenty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •