Base | Representation |
---|---|
bin | 1101001000000011111011… |
… | …0001001101000001000001 |
3 | 1220002200212212121002021010 |
4 | 3102000332301031001001 |
5 | 3342424012124402241 |
6 | 50410011323351133 |
7 | 3016454651061630 |
oct | 322007661150101 |
9 | 56080785532233 |
10 | 14432143200321 |
11 | 4664701656150 |
12 | 17510676824a9 |
13 | 808c3998c642 |
14 | 37c73b56d517 |
15 | 1a062e66cd16 |
hex | d203ec4d041 |
14432143200321 has 32 divisors (see below), whose sum is σ = 24639503182848. Its totient is φ = 7294589749440.
The previous prime is 14432143200283. The next prime is 14432143200383. The reversal of 14432143200321 is 12300234123441.
It is not a de Polignac number, because 14432143200321 - 26 = 14432143200257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14432143100321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 844272675 + ... + 844289768.
It is an arithmetic number, because the mean of its divisors is an integer number (769984474464).
Almost surely, 214432143200321 is an apocalyptic number.
14432143200321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14432143200321 is a deficient number, since it is larger than the sum of its proper divisors (10207359982527).
14432143200321 is a wasteful number, since it uses less digits than its factorization.
14432143200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688562501.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 14432143200321 its reverse (12300234123441), we get a palindrome (26732377323762).
The spelling of 14432143200321 in words is "fourteen trillion, four hundred thirty-two billion, one hundred forty-three million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •