Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …011001101111010001101 |
3 | 10220021011021200001201121 |
4 | 100001133103031322031 |
5 | 121020033242013010 |
6 | 2201502043240541 |
7 | 142360354554544 |
oct | 20013723157215 |
9 | 3807137601647 |
10 | 1101110501005 |
11 | 394a84198919 |
12 | 15949b819151 |
13 | 7caacb94868 |
14 | 3b418b7b15b |
15 | 1d99820d3da |
hex | 1005f4cde8d |
1101110501005 has 8 divisors (see below), whose sum is σ = 1321369625592. Its totient is φ = 880863717888.
The previous prime is 1101110500991. The next prime is 1101110501039. The reversal of 1101110501005 is 5001050111011.
It can be written as a sum of positive squares in 4 ways, for example, as 407844445129 + 693266055876 = 638627^2 + 832626^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101110501005 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 1101110501005.
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, 2887932 + ... + 3246901.
It is an arithmetic number, because the mean of its divisors is an integer number (165171203199).
Almost surely, 21101110501005 is an apocalyptic number.
It is an amenable number.
1101110501005 is a deficient number, since it is larger than the sum of its proper divisors (220259124587).
1101110501005 is an equidigital number, since it uses as much as digits as its factorization.
1101110501005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6170735.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 1101110501005 its reverse (5001050111011), we get a palindrome (6102160612016).
The spelling of 1101110501005 in words is "one trillion, one hundred one billion, one hundred ten million, five hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •