Base | Representation |
---|---|
bin | 110000101010011010110011… |
… | …000011001011011001001011 |
3 | 1001001210020012002211220021001 |
4 | 300222122303003023121023 |
5 | 211023010431411030233 |
6 | 2035103554303155431 |
7 | 63036344311456060 |
oct | 6052326303133113 |
9 | 1031706162756231 |
10 | 214021224314443 |
11 | 62214989670577 |
12 | 200068b6ba5b77 |
13 | 9256165446070 |
14 | 3abc97abd6c67 |
15 | 19b22b344827d |
hex | c2a6b30cb64b |
214021224314443 has 8 divisors (see below), whose sum is σ = 263410737617888. Its totient is φ = 169335474182784.
The previous prime is 214021224314399. The next prime is 214021224314459. The reversal of 214021224314443 is 344413422120412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 214021224314443 - 29 = 214021224313931 is a prime.
It is not an unprimeable number, because it can be changed into a prime (214021224314143) 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, 1175940792846 + ... + 1175940793027.
It is an arithmetic number, because the mean of its divisors is an integer number (32926342202236).
Almost surely, 2214021224314443 is an apocalyptic number.
214021224314443 is a deficient number, since it is larger than the sum of its proper divisors (49389513303445).
214021224314443 is a wasteful number, since it uses less digits than its factorization.
214021224314443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2351881585893.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 214021224314443 its reverse (344413422120412), we get a palindrome (558434646434855).
The spelling of 214021224314443 in words is "two hundred fourteen trillion, twenty-one billion, two hundred twenty-four million, three hundred fourteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •