Base | Representation |
---|---|
bin | 100001000111010… |
… | …0001111110000001 |
3 | 2212102202000002012 |
4 | 1002032201332001 |
5 | 4233420333114 |
6 | 302130502305 |
7 | 36351145241 |
oct | 10216417601 |
9 | 2772660065 |
10 | 1111105409 |
11 | 52020aa37 |
12 | 270134995 |
13 | 14926b72b |
14 | a77cdb21 |
15 | 6782b63e |
hex | 423a1f81 |
1111105409 has 4 divisors (see below), whose sum is σ = 1132069716. Its totient is φ = 1090141104.
The previous prime is 1111105403. The next prime is 1111105477. The reversal of 1111105409 is 9045011111.
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 759167809 + 351937600 = 27553^2 + 18760^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111105409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1111105403) 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 3 ways as a sum of consecutive naturals, for example, 10482074 + ... + 10482179.
It is an arithmetic number, because the mean of its divisors is an integer number (283017429).
Almost surely, 21111105409 is an apocalyptic number.
It is an amenable number.
1111105409 is a deficient number, since it is larger than the sum of its proper divisors (20964307).
1111105409 is an equidigital number, since it uses as much as digits as its factorization.
1111105409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20964306.
The product of its (nonzero) digits is 180, while the sum is 23.
The square root of 1111105409 is about 33333.2478015569. The cubic root of 1111105409 is about 1035.7423968698.
The spelling of 1111105409 in words is "one billion, one hundred eleven million, one hundred five thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •