Base | Representation |
---|---|
bin | 10100100010000010… |
… | …11111000001001001 |
3 | 1001110012202102212220 |
4 | 22101001133001021 |
5 | 140033343120410 |
6 | 5021445324253 |
7 | 540106060566 |
oct | 122101370111 |
9 | 31405672786 |
10 | 11023020105 |
11 | 4747231179 |
12 | 2177706689 |
13 | 1068927606 |
14 | 767d8386d |
15 | 447ada070 |
hex | 29105f049 |
11023020105 has 16 divisors (see below), whose sum is σ = 17645791680. Its totient is φ = 5875957568.
The previous prime is 11023020103. The next prime is 11023020119. The reversal of 11023020105 is 50102032011.
It is a cyclic number.
It is not a de Polignac number, because 11023020105 - 21 = 11023020103 is a prime.
It is a super-2 number, since 2×110230201052 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (11023020103) 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 15 ways as a sum of consecutive naturals, for example, 155982 + ... + 215351.
It is an arithmetic number, because the mean of its divisors is an integer number (1102861980).
Almost surely, 211023020105 is an apocalyptic number.
11023020105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11023020105 is a deficient number, since it is larger than the sum of its proper divisors (6622771575).
11023020105 is a wasteful number, since it uses less digits than its factorization.
11023020105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373320.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 11023020105 its reverse (50102032011), we get a palindrome (61125052116).
The spelling of 11023020105 in words is "eleven billion, twenty-three million, twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •