Base | Representation |
---|---|
bin | 10100100010000010… |
… | …11100110100011111 |
3 | 1001110012201222112111 |
4 | 22101001130310133 |
5 | 140033342323403 |
6 | 5021445214451 |
7 | 540106022416 |
oct | 122101346437 |
9 | 31405658474 |
10 | 11023011103 |
11 | 4747225435 |
12 | 2177701427 |
13 | 10689234a0 |
14 | 767d8047d |
15 | 447ad756d |
hex | 29105cd1f |
11023011103 has 8 divisors (see below), whose sum is σ = 12191771648. Its totient is φ = 9900084384.
The previous prime is 11023011053. The next prime is 11023011121. The reversal of 11023011103 is 30111032011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023011103 is a prime.
It is a super-2 number, since 2×110230111032 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023011133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11457951 + ... + 11458912.
It is an arithmetic number, because the mean of its divisors is an integer number (1523971456).
Almost surely, 211023011103 is an apocalyptic number.
11023011103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11023011103 is a deficient number, since it is larger than the sum of its proper divisors (1168760545).
11023011103 is a wasteful number, since it uses less digits than its factorization.
11023011103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22916913.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11023011103 its reverse (30111032011), we get a palindrome (41134043114).
The spelling of 11023011103 in words is "eleven billion, twenty-three million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •