Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00101100001101001 |
3 | 1001110000010122010020 |
4 | 22100312011201221 |
5 | 140032112011410 |
6 | 5021301311053 |
7 | 540041504325 |
oct | 122066054151 |
9 | 31400118106 |
10 | 11020032105 |
11 | 4745580255 |
12 | 2176705489 |
13 | 106811c574 |
14 | 767806985 |
15 | 4476e9a70 |
hex | 290d85869 |
11020032105 has 8 divisors (see below), whose sum is σ = 17632051392. Its totient is φ = 5877350448.
The previous prime is 11020032071. The next prime is 11020032137. The reversal of 11020032105 is 50123002011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11020032105 - 26 = 11020032041 is a prime.
It is a super-2 number, since 2×110200321052 (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), and also a Moran number because the ratio is a prime number: 734668807 = 11020032105 / (1 + 1 + 0 + 2 + 0 + 0 + 3 + 2 + 1 + 0 + 5).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 367334389 + ... + 367334418.
It is an arithmetic number, because the mean of its divisors is an integer number (2204006424).
Almost surely, 211020032105 is an apocalyptic number.
11020032105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11020032105 is a deficient number, since it is larger than the sum of its proper divisors (6612019287).
11020032105 is an equidigital number, since it uses as much as digits as its factorization.
11020032105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 734668815.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 11020032105 its reverse (50123002011), we get a palindrome (61143034116).
The spelling of 11020032105 in words is "eleven billion, twenty million, thirty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •