Base | Representation |
---|---|
bin | 1101000000011000001100… |
… | …0111010011001001110111 |
3 | 1212122002011202022021220001 |
4 | 3100012003013103021313 |
5 | 3333243144314412033 |
6 | 50225221334252131 |
7 | 3004102642136416 |
oct | 320060307231167 |
9 | 55562152267801 |
10 | 14300145857143 |
11 | 4613726594583 |
12 | 172b569ab7047 |
13 | 7c9662060b53 |
14 | 3761b8adb47d |
15 | 19bea62bde7d |
hex | d01831d3277 |
14300145857143 has 4 divisors (see below), whose sum is σ = 14300438444248. Its totient is φ = 14299853270040.
The previous prime is 14300145857111. The next prime is 14300145857189. The reversal of 14300145857143 is 34175854100341.
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 14300145857143 - 25 = 14300145857111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14300145857093 and 14300145857102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14300145857743) 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, 146220228 + ... + 146317993.
It is an arithmetic number, because the mean of its divisors is an integer number (3575109611062).
Almost surely, 214300145857143 is an apocalyptic number.
14300145857143 is a deficient number, since it is larger than the sum of its proper divisors (292587105).
14300145857143 is an equidigital number, since it uses as much as digits as its factorization.
14300145857143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292587104.
The product of its (nonzero) digits is 806400, while the sum is 46.
Adding to 14300145857143 its reverse (34175854100341), we get a palindrome (48475999957484).
The spelling of 14300145857143 in words is "fourteen trillion, three hundred billion, one hundred forty-five million, eight hundred fifty-seven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •