Base | Representation |
---|---|
bin | 111100010000101… |
… | …011001011000101 |
3 | 2121110101022220100 |
4 | 330100223023011 |
5 | 4032304112401 |
6 | 244153154313 |
7 | 34024251552 |
oct | 7420531305 |
9 | 2543338810 |
10 | 1011004101 |
11 | 47975a388 |
12 | 2426bb999 |
13 | 1315c0aa3 |
14 | 983b3a29 |
15 | 5db56b86 |
hex | 3c42b2c5 |
1011004101 has 6 divisors (see below), whose sum is σ = 1460339270. Its totient is φ = 674002728.
The previous prime is 1011004091. The next prime is 1011004121. The reversal of 1011004101 is 1014001101.
It can be written as a sum of positive squares in only one way, i.e., 575280225 + 435723876 = 23985^2 + 20874^2 .
It is not a de Polignac number, because 1011004101 - 25 = 1011004069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 112333789 = 1011004101 / (1 + 0 + 1 + 1 + 0 + 0 + 4 + 1 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011004121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56166886 + ... + 56166903.
Almost surely, 21011004101 is an apocalyptic number.
It is an amenable number.
1011004101 is a deficient number, since it is larger than the sum of its proper divisors (449335169).
1011004101 is a wasteful number, since it uses less digits than its factorization.
1011004101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112333795 (or 112333792 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1011004101 is about 31796.2906798891. The cubic root of 1011004101 is about 1003.6546608495.
Adding to 1011004101 its reverse (1014001101), we get a palindrome (2025005202).
The spelling of 1011004101 in words is "one billion, eleven million, four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •