Base | Representation |
---|---|
bin | 101010000101… |
… | …010111010111 |
3 | 202202111002110 |
4 | 222011113113 |
5 | 10311011043 |
6 | 1032242103 |
7 | 162525222 |
oct | 52052727 |
9 | 22674073 |
10 | 11032023 |
11 | 6255582 |
12 | 3840333 |
13 | 2393532 |
14 | 16725b9 |
15 | e7db33 |
hex | a855d7 |
11032023 has 4 divisors (see below), whose sum is σ = 14709368. Its totient is φ = 7354680.
The previous prime is 11031983. The next prime is 11032039. The reversal of 11032023 is 32023011.
It is a happy number.
11032023 is digitally balanced in base 3, 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, and also an emirpimes, since its reverse is a distinct semiprime: 32023011 = 3 ⋅10674337.
It is not a de Polignac number, because 11032023 - 218 = 10769879 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11032223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1838668 + ... + 1838673.
It is an arithmetic number, because the mean of its divisors is an integer number (3677342).
Almost surely, 211032023 is an apocalyptic number.
11032023 is a deficient number, since it is larger than the sum of its proper divisors (3677345).
11032023 is an equidigital number, since it uses as much as digits as its factorization.
11032023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677344.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 11032023 is about 3321.4489308132. The cubic root of 11032023 is about 222.6136136508.
Adding to 11032023 its reverse (32023011), we get a palindrome (43055034).
The spelling of 11032023 in words is "eleven million, thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •