Base | Representation |
---|---|
bin | 1100101111100111111110… |
… | …0110011110010000111111 |
3 | 1211121120020221220200101202 |
4 | 3023321333212132100333 |
5 | 3314034214433031143 |
6 | 45445101155330115 |
7 | 2644233311515421 |
oct | 313717746362077 |
9 | 54546227820352 |
10 | 14012324111423 |
11 | 4512658729a40 |
12 | 16a3822bb093b |
13 | 7a84832a9181 |
14 | 3662b3138811 |
15 | 19475cd41ab8 |
hex | cbe7f99e43f |
14012324111423 has 4 divisors (see below), whose sum is σ = 15286171757928. Its totient is φ = 12738476464920.
The previous prime is 14012324111399. The next prime is 14012324111441. The reversal of 14012324111423 is 32411142321041.
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 14012324111423 - 228 = 14012055675967 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 (14012324110423) 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, 636923823236 + ... + 636923823257.
It is an arithmetic number, because the mean of its divisors is an integer number (3821542939482).
Almost surely, 214012324111423 is an apocalyptic number.
14012324111423 is a deficient number, since it is larger than the sum of its proper divisors (1273847646505).
14012324111423 is a wasteful number, since it uses less digits than its factorization.
14012324111423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273847646504.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 14012324111423 its reverse (32411142321041), we get a palindrome (46423466432464).
The spelling of 14012324111423 in words is "fourteen trillion, twelve billion, three hundred twenty-four million, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •