Base | Representation |
---|---|
bin | 100000111100011… |
… | …0101111101010101 |
3 | 2212001001011022211 |
4 | 1001320311331111 |
5 | 4230441420432 |
6 | 301404553421 |
7 | 36251626114 |
oct | 10170657525 |
9 | 2761034284 |
10 | 1105420117 |
11 | 517a8754a |
12 | 26a252871 |
13 | 14802aa59 |
14 | a6b4dc7b |
15 | 670a6d47 |
hex | 41e35f55 |
1105420117 has 4 divisors (see below), whose sum is σ = 1105564896. Its totient is φ = 1105275340.
The previous prime is 1105420109. The next prime is 1105420159. The reversal of 1105420117 is 7110245011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1105420117 - 23 = 1105420109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105420517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60259 + ... + 76432.
It is an arithmetic number, because the mean of its divisors is an integer number (276391224).
Almost surely, 21105420117 is an apocalyptic number.
It is an amenable number.
1105420117 is a deficient number, since it is larger than the sum of its proper divisors (144779).
1105420117 is an equidigital number, since it uses as much as digits as its factorization.
1105420117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144778.
The product of its (nonzero) digits is 280, while the sum is 22.
The square root of 1105420117 is about 33247.8588333144. The cubic root of 1105420117 is about 1033.9728167850.
Adding to 1105420117 its reverse (7110245011), we get a palindrome (8215665128).
The spelling of 1105420117 in words is "one billion, one hundred five million, four hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •