Base | Representation |
---|---|
bin | 100000111011100… |
… | …1111101000110011 |
3 | 2212000020212102101 |
4 | 1001313033220303 |
5 | 4230340013021 |
6 | 301352001231 |
7 | 36245232202 |
oct | 10167175063 |
9 | 2760225371 |
10 | 1105001011 |
11 | 517820684 |
12 | 26a090217 |
13 | 147c1206a |
14 | a6a81239 |
15 | 67022a91 |
hex | 41dcfa33 |
1105001011 has 8 divisors (see below), whose sum is σ = 1123519040. Its totient is φ = 1086628608.
The previous prime is 1105000999. The next prime is 1105001017. The reversal of 1105001011 is 1101005011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1105001011 - 25 = 1105000979 is a prime.
It is a super-2 number, since 2×11050010112 = 2442054468622044242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1105001017) 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 7 ways as a sum of consecutive naturals, for example, 21051 + ... + 51508.
It is an arithmetic number, because the mean of its divisors is an integer number (140439880).
Almost surely, 21105001011 is an apocalyptic number.
1105001011 is a deficient number, since it is larger than the sum of its proper divisors (18518029).
1105001011 is an equidigital number, since it uses as much as digits as its factorization.
1105001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72813.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 1105001011 is about 33241.5554840624. Note that the first 3 decimals coincide. The cubic root of 1105001011 is about 1033.8421277128.
Adding to 1105001011 its reverse (1101005011), we get a palindrome (2206006022).
The spelling of 1105001011 in words is "one billion, one hundred five million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •