Base | Representation |
---|---|
bin | 100000110100100… |
… | …1101100010110111 |
3 | 2211202022222100101 |
4 | 1001221031202313 |
5 | 4223414304143 |
6 | 301141054531 |
7 | 36202041355 |
oct | 10151154267 |
9 | 2752288311 |
10 | 1101322423 |
11 | 515738923 |
12 | 2689b7447 |
13 | 147224896 |
14 | a63a47d5 |
15 | 66a47b4d |
hex | 41a4d8b7 |
1101322423 has 2 divisors, whose sum is σ = 1101322424. Its totient is φ = 1101322422.
The previous prime is 1101322367. The next prime is 1101322429. The reversal of 1101322423 is 3242231011.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (3242231011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101322423 - 29 = 1101321911 is a prime.
It is a super-2 number, since 2×11013224232 = 2425822158805181858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1101322423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101322429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550661211 + 550661212.
It is an arithmetic number, because the mean of its divisors is an integer number (550661212).
Almost surely, 21101322423 is an apocalyptic number.
1101322423 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101322423 is an equidigital number, since it uses as much as digits as its factorization.
1101322423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1101322423 is about 33186.1781921329. The cubic root of 1101322423 is about 1032.6936197853.
Adding to 1101322423 its reverse (3242231011), we get a palindrome (4343553434).
The spelling of 1101322423 in words is "one billion, one hundred one million, three hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •