Base | Representation |
---|---|
bin | 1100010010011111101… |
… | …0110011000010010011 |
3 | 202011221112101211210212 |
4 | 3010213322303002103 |
5 | 11424340004403243 |
6 | 240553313114335 |
7 | 21152553634031 |
oct | 3044772630223 |
9 | 664845354725 |
10 | 211123122323 |
11 | 8159a553683 |
12 | 34b008589ab |
13 | 16ba78c4969 |
14 | a30b481551 |
15 | 5759c34318 |
hex | 3127eb3093 |
211123122323 has 4 divisors (see below), whose sum is σ = 212521288848. Its totient is φ = 209724955800.
The previous prime is 211123122319. The next prime is 211123122389. The reversal of 211123122323 is 323221321112.
211123122323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211123122323 - 22 = 211123122319 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211123122823) 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 3 ways as a sum of consecutive naturals, for example, 699083036 + ... + 699083337.
It is an arithmetic number, because the mean of its divisors is an integer number (53130322212).
Almost surely, 2211123122323 is an apocalyptic number.
211123122323 is a deficient number, since it is larger than the sum of its proper divisors (1398166525).
211123122323 is a wasteful number, since it uses less digits than its factorization.
211123122323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1398166524.
The product of its digits is 864, while the sum is 23.
Adding to 211123122323 its reverse (323221321112), we get a palindrome (534344443435).
The spelling of 211123122323 in words is "two hundred eleven billion, one hundred twenty-three million, one hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •