Base | Representation |
---|---|
bin | 100000111011110… |
… | …0111110100110001 |
3 | 2212000102220022122 |
4 | 1001313213310301 |
5 | 4230401200311 |
6 | 301354044025 |
7 | 36246124061 |
oct | 10167476461 |
9 | 2760386278 |
10 | 1105100081 |
11 | 517889058 |
12 | 26a119615 |
13 | 147c48197 |
14 | a6aa93a1 |
15 | 670420db |
hex | 41de7d31 |
1105100081 has 8 divisors (see below), whose sum is σ = 1117696320. Its totient is φ = 1092539952.
The previous prime is 1105100069. The next prime is 1105100089. The reversal of 1105100081 is 1800015011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1105100081 - 226 = 1037991217 is a prime.
It is a super-2 number, since 2×11051000812 = 2442492378052413122, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1105100089) 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, 55091 + ... + 72423.
It is an arithmetic number, because the mean of its divisors is an integer number (139712040).
Almost surely, 21105100081 is an apocalyptic number.
It is an amenable number.
1105100081 is a deficient number, since it is larger than the sum of its proper divisors (12596239).
1105100081 is a wasteful number, since it uses less digits than its factorization.
1105100081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18055.
The product of its (nonzero) digits is 40, while the sum is 17.
The square root of 1105100081 is about 33243.0456035544. The cubic root of 1105100081 is about 1033.8730235153.
Adding to 1105100081 its reverse (1800015011), we get a palindrome (2905115092).
The spelling of 1105100081 in words is "one billion, one hundred five million, one hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •