Base | Representation |
---|---|
bin | 1100111011111100111001… |
… | …1011111010010110000111 |
3 | 1212100210212222212121210101 |
4 | 3032333032123322112013 |
5 | 3331021424113443143 |
6 | 50130243354504531 |
7 | 2665441314203455 |
oct | 316771633722607 |
9 | 55323788777711 |
10 | 14224100140423 |
11 | 4594452787008 |
12 | 1718886435147 |
13 | 7c2433231b34 |
14 | 3726431b59d5 |
15 | 19a005044b4d |
hex | cefce6fa587 |
14224100140423 has 4 divisors (see below), whose sum is σ = 14242173966040. Its totient is φ = 14206026314808.
The previous prime is 14224100140399. The next prime is 14224100140427. The reversal of 14224100140423 is 32404100142241.
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 14224100140423 - 25 = 14224100140391 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14224100140391 and 14224100140400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14224100140427) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9036911628 + ... + 9036913201.
It is an arithmetic number, because the mean of its divisors is an integer number (3560543491510).
Almost surely, 214224100140423 is an apocalyptic number.
14224100140423 is a deficient number, since it is larger than the sum of its proper divisors (18073825617).
14224100140423 is an equidigital number, since it uses as much as digits as its factorization.
14224100140423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18073825616.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 14224100140423 its reverse (32404100142241), we get a palindrome (46628200282664).
The spelling of 14224100140423 in words is "fourteen trillion, two hundred twenty-four billion, one hundred million, one hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •