Base | Representation |
---|---|
bin | 1100110110001001100101… |
… | …0001101000000110110111 |
3 | 1212000021121101122020212211 |
4 | 3031202121101220012313 |
5 | 3322403310021112043 |
6 | 50012400521154251 |
7 | 2655312252054634 |
oct | 315423121500667 |
9 | 55007541566784 |
10 | 14124424004023 |
11 | 4556153144483 |
12 | 17014a902b987 |
13 | 7b5c09857078 |
14 | 36b8a917b18b |
15 | 19761e47ea9d |
hex | cd8994681b7 |
14124424004023 has 8 divisors (see below), whose sum is σ = 14787514954800. Its totient is φ = 13473069176448.
The previous prime is 14124424004021. The next prime is 14124424004039. The reversal of 14124424004023 is 32040042442141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14124424004023 - 21 = 14124424004021 is a prime.
It is a super-2 number, since 2×141244240040232 (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 (14124424004021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2934028338 + ... + 2934033151.
It is an arithmetic number, because the mean of its divisors is an integer number (1848439369350).
Almost surely, 214124424004023 is an apocalyptic number.
14124424004023 is a deficient number, since it is larger than the sum of its proper divisors (663090950777).
14124424004023 is an equidigital number, since it uses as much as digits as its factorization.
14124424004023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5868061601.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 14124424004023 its reverse (32040042442141), we get a palindrome (46164466446164).
The spelling of 14124424004023 in words is "fourteen trillion, one hundred twenty-four billion, four hundred twenty-four million, four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •