Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100100010010101011 |
3 | 1220220111111220200211 |
4 | 102232221210102223 |
5 | 312141130020243 |
6 | 13123255041551 |
7 | 1311226122316 |
oct | 225651442253 |
9 | 56814456624 |
10 | 20110001323 |
11 | 858a631705 |
12 | 3a929702b7 |
13 | 1b86410789 |
14 | d8ab5b97d |
15 | 7ca748d9d |
hex | 4aea644ab |
20110001323 has 4 divisors (see below), whose sum is σ = 20119914640. Its totient is φ = 20100088008.
The previous prime is 20110001273. The next prime is 20110001377. The reversal of 20110001323 is 32310001102.
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 20110001323 - 29 = 20110000811 is a prime.
It is a super-2 number, since 2×201100013232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110001623) 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 3 ways as a sum of consecutive naturals, for example, 4953615 + ... + 4957672.
It is an arithmetic number, because the mean of its divisors is an integer number (5029978660).
Almost surely, 220110001323 is an apocalyptic number.
20110001323 is a deficient number, since it is larger than the sum of its proper divisors (9913317).
20110001323 is an equidigital number, since it uses as much as digits as its factorization.
20110001323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9913316.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20110001323 its reverse (32310001102), we get a palindrome (52420002425).
The spelling of 20110001323 in words is "twenty billion, one hundred ten million, one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •