Base | Representation |
---|---|
bin | 111011111101100… |
… | …101101111010001 |
3 | 2121002222011002012 |
4 | 323331211233101 |
5 | 4030014013410 |
6 | 243454032305 |
7 | 33633603554 |
oct | 7375455721 |
9 | 2532864065 |
10 | 1006001105 |
11 | 47695257a |
12 | 240aa8695 |
13 | 13055b835 |
14 | 9787069b |
15 | 5d4b9605 |
hex | 3bf65bd1 |
1006001105 has 4 divisors (see below), whose sum is σ = 1207201332. Its totient is φ = 804800880.
The previous prime is 1006001099. The next prime is 1006001123. The reversal of 1006001105 is 5011006001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 141229456 + 864771649 = 11884^2 + 29407^2 .
It is not a de Polignac number, because 1006001105 - 26 = 1006001041 is a prime.
It is a super-2 number, since 2×10060011052 = 2024076446522442050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1006001105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100600106 + ... + 100600115.
It is an arithmetic number, because the mean of its divisors is an integer number (301800333).
Almost surely, 21006001105 is an apocalyptic number.
It is an amenable number.
1006001105 is a deficient number, since it is larger than the sum of its proper divisors (201200227).
1006001105 is an equidigital number, since it uses as much as digits as its factorization.
1006001105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201200226.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 1006001105 is about 31717.5204737066. The cubic root of 1006001105 is about 1001.9963801474.
Adding to 1006001105 its reverse (5011006001), we get a palindrome (6017007106).
The spelling of 1006001105 in words is "one billion, six million, one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •