Base | Representation |
---|---|
bin | 1101000000010111110011… |
… | …1110111110110000010111 |
3 | 1212122001220120210021110000 |
4 | 3100011330332332300113 |
5 | 3333242442002410033 |
6 | 50225203222102343 |
7 | 3004100253030606 |
oct | 320057476766027 |
9 | 55561816707400 |
10 | 14300043013143 |
11 | 4613683530338 |
12 | 172b53b57a9b3 |
13 | 7c9646962a04 |
14 | 3761a91a9a3d |
15 | 19be9c256a13 |
hex | d017cfbec17 |
14300043013143 has 40 divisors (see below), whose sum is σ = 22490804481200. Its totient is φ = 9029715553152.
The previous prime is 14300043013129. The next prime is 14300043013153. The reversal of 14300043013143 is 34131034000341.
14300043013143 is a `hidden beast` number, since 1 + 4 + 300 + 0 + 43 + 0 + 1 + 314 + 3 = 666.
It is not a de Polignac number, because 14300043013143 - 26 = 14300043013079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14300043013153) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6400155 + ... + 8340387.
It is an arithmetic number, because the mean of its divisors is an integer number (562270112030).
Almost surely, 214300043013143 is an apocalyptic number.
14300043013143 is a deficient number, since it is larger than the sum of its proper divisors (8190761468057).
14300043013143 is a wasteful number, since it uses less digits than its factorization.
14300043013143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1945053 (or 1945044 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 14300043013143 its reverse (34131034000341), we get a palindrome (48431077013484).
The spelling of 14300043013143 in words is "fourteen trillion, three hundred billion, forty-three million, thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •