Base | Representation |
---|---|
bin | 10100111011000101… |
… | …00101010000101111 |
3 | 1001222211220200201202 |
4 | 22131202211100233 |
5 | 141001123214043 |
6 | 5054350400115 |
7 | 545236056155 |
oct | 123542452057 |
9 | 31884820652 |
10 | 11233023023 |
11 | 4844826502 |
12 | 2215b0003b |
13 | 10a02a48b1 |
14 | 787c0b3d5 |
15 | 45b26d1b8 |
hex | 29d8a542f |
11233023023 has 2 divisors, whose sum is σ = 11233023024. Its totient is φ = 11233023022.
The previous prime is 11233022989. The next prime is 11233023047. The reversal of 11233023023 is 32032033211.
11233023023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (32032033211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11233023023 - 26 = 11233022959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11233022986 and 11233023004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11233023083) 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 as a sum of consecutive naturals, namely, 5616511511 + 5616511512.
It is an arithmetic number, because the mean of its divisors is an integer number (5616511512).
Almost surely, 211233023023 is an apocalyptic number.
11233023023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233023023 is an equidigital number, since it uses as much as digits as its factorization.
11233023023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 11233023023 its reverse (32032033211), we get a palindrome (43265056234).
The spelling of 11233023023 in words is "eleven billion, two hundred thirty-three million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •