Base | Representation |
---|---|
bin | 10101000101110100… |
… | …01101001101000111 |
3 | 1002020010102011220000 |
4 | 22202322031031013 |
5 | 141142203231043 |
6 | 5111325212343 |
7 | 550411531152 |
oct | 124272151507 |
9 | 32203364800 |
10 | 11323102023 |
11 | 4890661162 |
12 | 22401010b3 |
13 | 10b5b5378c |
14 | 795b78c99 |
15 | 4641132d3 |
hex | 2a2e8d347 |
11323102023 has 20 divisors (see below), whose sum is σ = 16926312480. Its totient is φ = 7543577952.
The previous prime is 11323102001. The next prime is 11323102027. The reversal of 11323102023 is 32020132311.
11323102023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11323102023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11323101987 and 11323102005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11323102027) 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 19 ways as a sum of consecutive naturals, for example, 73443 + ... + 167451.
It is an arithmetic number, because the mean of its divisors is an integer number (846315624).
Almost surely, 211323102023 is an apocalyptic number.
11323102023 is a deficient number, since it is larger than the sum of its proper divisors (5603210457).
11323102023 is an equidigital number, since it uses as much as digits as its factorization.
11323102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95508 (or 95499 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11323102023 its reverse (32020132311), we get a palindrome (43343234334).
The spelling of 11323102023 in words is "eleven billion, three hundred twenty-three million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •