Base | Representation |
---|---|
bin | 100001000101001… |
… | …0100010101110101 |
3 | 2212100122220010122 |
4 | 1002022110111311 |
5 | 4233130013023 |
6 | 302051101325 |
7 | 36335565362 |
oct | 10212242565 |
9 | 2770586118 |
10 | 1110001013 |
11 | 51a626210 |
12 | 26b8a1845 |
13 | 148c72b44 |
14 | a75c3469 |
15 | 676ae2c8 |
hex | 42294575 |
1110001013 has 8 divisors (see below), whose sum is σ = 1252666080. Its totient is φ = 974295280.
The previous prime is 1110000961. The next prime is 1110001037. The reversal of 1110001013 is 3101000111.
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 1110001013 - 26 = 1110000949 is a prime.
It is a super-2 number, since 2×11100010132 = 2464204497722052338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110001063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1739495 + ... + 1740132.
It is an arithmetic number, because the mean of its divisors is an integer number (156583260).
Almost surely, 21110001013 is an apocalyptic number.
It is an amenable number.
1110001013 is a deficient number, since it is larger than the sum of its proper divisors (142665067).
1110001013 is a wasteful number, since it uses less digits than its factorization.
1110001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3479667.
The product of its (nonzero) digits is 3, while the sum is 8.
The square root of 1110001013 is about 33316.6777005151. The cubic root of 1110001013 is about 1035.3991204210.
Adding to 1110001013 its reverse (3101000111), we get a palindrome (4211001124).
The spelling of 1110001013 in words is "one billion, one hundred ten million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •