Base | Representation |
---|---|
bin | 110000000011001001000011… |
… | …111010100100000010010111 |
3 | 1000201020012022220111121112102 |
4 | 300003021003322210002113 |
5 | 210144300200300320343 |
6 | 2025240013013312315 |
7 | 62340343066211000 |
oct | 6003110372440227 |
9 | 1021205286447472 |
10 | 211322120323223 |
11 | 61374231847818 |
12 | 1b84b78663569b |
13 | 90bb78a271890 |
14 | 3a2808c0401a7 |
15 | 1966e8eda23b8 |
hex | c03243ea4097 |
211322120323223 has 64 divisors (see below), whose sum is σ = 279416565120000. Its totient is φ = 158370654943872.
The previous prime is 211322120323189. The next prime is 211322120323271. The reversal of 211322120323223 is 322323021223112.
It is not a de Polignac number, because 211322120323223 - 26 = 211322120323159 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211322120323823) 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 63 ways as a sum of consecutive naturals, for example, 463789208 + ... + 464244626.
It is an arithmetic number, because the mean of its divisors is an integer number (4365883830000).
Almost surely, 2211322120323223 is an apocalyptic number.
211322120323223 is a deficient number, since it is larger than the sum of its proper divisors (68094444796777).
211322120323223 is a wasteful number, since it uses less digits than its factorization.
211322120323223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460949 (or 460935 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 211322120323223 its reverse (322323021223112), we get a palindrome (533645141546335).
The spelling of 211322120323223 in words is "two hundred eleven trillion, three hundred twenty-two billion, one hundred twenty million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •