Base | Representation |
---|---|
bin | 100001001101100… |
… | …0111101000011101 |
3 | 2212122221122211021 |
4 | 1002123013220131 |
5 | 4240241433110 |
6 | 302325324141 |
7 | 36421201231 |
oct | 10233075035 |
9 | 2778848737 |
10 | 1114405405 |
11 | 522064303 |
12 | 271266651 |
13 | 149b557a9 |
14 | a800c5c1 |
15 | 67c7e2da |
hex | 426c7a1d |
1114405405 has 8 divisors (see below), whose sum is σ = 1373429592. Its totient is φ = 867428928.
The previous prime is 1114405351. The next prime is 1114405433. The reversal of 1114405405 is 5045044111.
It can be written as a sum of positive squares in 4 ways, for example, as 412049401 + 702356004 = 20299^2 + 26502^2 .
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 1114405405 - 211 = 1114403357 is a prime.
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 1114405405.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3011722 + ... + 3012091.
It is an arithmetic number, because the mean of its divisors is an integer number (171678699).
Almost surely, 21114405405 is an apocalyptic number.
It is an amenable number.
1114405405 is a deficient number, since it is larger than the sum of its proper divisors (259024187).
1114405405 is an equidigital number, since it uses as much as digits as its factorization.
1114405405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6023855.
The product of its (nonzero) digits is 1600, while the sum is 25.
The square root of 1114405405 is about 33382.7111691067. The cubic root of 1114405405 is about 1036.7667723946.
Adding to 1114405405 its reverse (5045044111), we get a palindrome (6159449516).
The spelling of 1114405405 in words is "one billion, one hundred fourteen million, four hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •