Base | Representation |
---|---|
bin | 1100011110010110000… |
… | …1111110011011101011 |
3 | 202111011020022201121012 |
4 | 3013211201332123223 |
5 | 12002343344131233 |
6 | 242241112334135 |
7 | 21324442244012 |
oct | 3074541763353 |
9 | 674136281535 |
10 | 214304286443 |
11 | 82982201335 |
12 | 3564a0a434b |
13 | 17293999bb0 |
14 | a52db65a79 |
15 | 5894161548 |
hex | 31e587e6eb |
214304286443 has 8 divisors (see below), whose sum is σ = 235699641408. Its totient is φ = 193610418624.
The previous prime is 214304286431. The next prime is 214304286463. The reversal of 214304286443 is 344682403412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 214304286443 - 26 = 214304286379 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 214304286443.
It is not an unprimeable number, because it can be changed into a prime (214304286463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175371146 + ... + 175372367.
It is an arithmetic number, because the mean of its divisors is an integer number (29462455176).
Almost surely, 2214304286443 is an apocalyptic number.
214304286443 is a deficient number, since it is larger than the sum of its proper divisors (21395354965).
214304286443 is a wasteful number, since it uses less digits than its factorization.
214304286443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350743573.
The product of its (nonzero) digits is 442368, while the sum is 41.
Adding to 214304286443 its reverse (344682403412), we get a palindrome (558986689855).
The spelling of 214304286443 in words is "two hundred fourteen billion, three hundred four million, two hundred eighty-six thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •