Base | Representation |
---|---|
bin | 1100011110011100010… |
… | …1010011000001000011 |
3 | 202111020001022112001112 |
4 | 3013213011103001003 |
5 | 12002422030314021 |
6 | 242243442353535 |
7 | 21325206454250 |
oct | 3074705230103 |
9 | 674201275045 |
10 | 214330323011 |
11 | 82995974a62 |
12 | 3565695b8ab |
13 | 172991b4b4c |
14 | a5333c2427 |
15 | 58965a5d5b |
hex | 31e7153043 |
214330323011 has 8 divisors (see below), whose sum is σ = 246302251104. Its totient is φ = 182696722560.
The previous prime is 214330323007. The next prime is 214330323013. The reversal of 214330323011 is 110323033412.
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 214330323011 - 22 = 214330323007 is a prime.
It is a super-3 number, since 3×2143303230113 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (214330323013) 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 7 ways as a sum of consecutive naturals, for example, 84580550 + ... + 84583083.
It is an arithmetic number, because the mean of its divisors is an integer number (30787781388).
Almost surely, 2214330323011 is an apocalyptic number.
214330323011 is a deficient number, since it is larger than the sum of its proper divisors (31971928093).
214330323011 is a wasteful number, since it uses less digits than its factorization.
214330323011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169163821.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 214330323011 its reverse (110323033412), we get a palindrome (324653356423).
The spelling of 214330323011 in words is "two hundred fourteen billion, three hundred thirty million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •