Base | Representation |
---|---|
bin | 1100011110011111011… |
… | …0110101101011000101 |
3 | 202111020221202022212220 |
4 | 3013213312311223011 |
5 | 12002433341410041 |
6 | 242245025002553 |
7 | 21325425034251 |
oct | 3074766655305 |
9 | 674227668786 |
10 | 214343310021 |
11 | 829a2235325 |
12 | 3565b183459 |
13 | 1729bab1179 |
14 | a535003261 |
15 | 58977bdd66 |
hex | 31e7db5ac5 |
214343310021 has 8 divisors (see below), whose sum is σ = 293515163424. Its totient is φ = 139033498320.
The previous prime is 214343310019. The next prime is 214343310029. The reversal of 214343310021 is 120013343412.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 214343310021 - 21 = 214343310019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 214343309973 and 214343310000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214343310029) 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, 965510295 + ... + 965510516.
It is an arithmetic number, because the mean of its divisors is an integer number (36689395428).
Almost surely, 2214343310021 is an apocalyptic number.
It is an amenable number.
214343310021 is a deficient number, since it is larger than the sum of its proper divisors (79171853403).
214343310021 is a wasteful number, since it uses less digits than its factorization.
214343310021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1931020851.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 214343310021 its reverse (120013343412), we get a palindrome (334356653433).
The spelling of 214343310021 in words is "two hundred fourteen billion, three hundred forty-three million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •