Base | Representation |
---|---|
bin | 1100111010100111011000… |
… | …1101111000001100111111 |
3 | 1212021121122020011100200011 |
4 | 3032221312031320030333 |
5 | 3330132421134331033 |
6 | 50111525511244051 |
7 | 2663666421531004 |
oct | 316516615701477 |
9 | 55247566140604 |
10 | 14201145230143 |
11 | 4585743294183 |
12 | 171433a979627 |
13 | 7c02155cc0a1 |
14 | 3714a66a38ab |
15 | 19960eb8eccd |
hex | cea7637833f |
14201145230143 has 4 divisors (see below), whose sum is σ = 14201170299288. Its totient is φ = 14201120161000.
The previous prime is 14201145230141. The next prime is 14201145230179. The reversal of 14201145230143 is 34103254110241.
It is a happy number.
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 14201145230143 - 21 = 14201145230141 is a prime.
It is a super-2 number, since 2×142011452301432 (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 (14201145230141) 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, 11664733 + ... + 12824518.
It is an arithmetic number, because the mean of its divisors is an integer number (3550292574822).
Almost surely, 214201145230143 is an apocalyptic number.
14201145230143 is a deficient number, since it is larger than the sum of its proper divisors (25069145).
14201145230143 is an equidigital number, since it uses as much as digits as its factorization.
14201145230143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25069144.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 14201145230143 its reverse (34103254110241), we get a palindrome (48304399340384).
The spelling of 14201145230143 in words is "fourteen trillion, two hundred one billion, one hundred forty-five million, two hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •