Base | Representation |
---|---|
bin | 1100010011110000100… |
… | …1000111011101100011 |
3 | 202012211011211222011110 |
4 | 3010330021013131203 |
5 | 11431033334422243 |
6 | 241051113314403 |
7 | 21164143626030 |
oct | 3047411073543 |
9 | 665734758143 |
10 | 211462420323 |
11 | 81754029250 |
12 | 34b96405a03 |
13 | 16c2cca18cb |
14 | a340564387 |
15 | 5779906e33 |
hex | 313c247763 |
211462420323 has 32 divisors (see below), whose sum is σ = 352858632192. Its totient is φ = 109432893600.
The previous prime is 211462420289. The next prime is 211462420343. The reversal of 211462420323 is 323024264112.
211462420323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 211462420323 - 28 = 211462420067 is a prime.
It is a super-2 number, since 2×2114624203232 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211462420343) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1679593 + ... + 1801098.
It is an arithmetic number, because the mean of its divisors is an integer number (11026832256).
Almost surely, 2211462420323 is an apocalyptic number.
211462420323 is a deficient number, since it is larger than the sum of its proper divisors (141396211869).
211462420323 is a wasteful number, since it uses less digits than its factorization.
211462420323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3480975.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 211462420323 its reverse (323024264112), we get a palindrome (534486684435).
The spelling of 211462420323 in words is "two hundred eleven billion, four hundred sixty-two million, four hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •