Base | Representation |
---|---|
bin | 110000000001100100100100… |
… | …100111011001000001110110 |
3 | 1000200211212211012221011011220 |
4 | 300001210210213121001312 |
5 | 210141013211040140202 |
6 | 2025114250145011210 |
7 | 62326503203242512 |
oct | 6001444447310166 |
9 | 1020755735834156 |
10 | 211214221021302 |
11 | 613324a2472224 |
12 | 1b832893323b06 |
13 | 90b15530484b5 |
14 | 3a22b73c49142 |
15 | 196427740dabc |
hex | c019249d9076 |
211214221021302 has 32 divisors (see below), whose sum is σ = 434660164230240. Its totient is φ = 68392424755200.
The previous prime is 211214221021277. The next prime is 211214221021357. The reversal of 211214221021302 is 203120122412112.
It is a super-3 number, since 3×2112142210213023 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3288065227 + ... + 3288129462.
It is an arithmetic number, because the mean of its divisors is an integer number (13583130132195).
Almost surely, 2211214221021302 is an apocalyptic number.
211214221021302 is an abundant number, since it is smaller than the sum of its proper divisors (223445943208938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211214221021302 is a wasteful number, since it uses less digits than its factorization.
211214221021302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6576194848.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 211214221021302 its reverse (203120122412112), we get a palindrome (414334343433414).
The spelling of 211214221021302 in words is "two hundred eleven trillion, two hundred fourteen billion, two hundred twenty-one million, twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •