Base | Representation |
---|---|
bin | 100000111000000… |
… | …0101101010000001 |
3 | 2211212201120011222 |
4 | 1001300011222001 |
5 | 4224400000441 |
6 | 301243444425 |
7 | 36223260140 |
oct | 10160055201 |
9 | 2755646158 |
10 | 1103125121 |
11 | 51675a25a |
12 | 269526715 |
13 | 147706277 |
14 | a6713757 |
15 | 66ca1d4b |
hex | 41c05a81 |
1103125121 has 8 divisors (see below), whose sum is σ = 1334874240. Its totient is φ = 889915968.
The previous prime is 1103125081. The next prime is 1103125129. The reversal of 1103125121 is 1215213011.
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 1103125121 - 214 = 1103108737 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 1103125121.
It is not an unprimeable number, because it can be changed into a prime (1103125129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4634861 + ... + 4635098.
It is an arithmetic number, because the mean of its divisors is an integer number (166859280).
Almost surely, 21103125121 is an apocalyptic number.
It is an amenable number.
1103125121 is a deficient number, since it is larger than the sum of its proper divisors (231749119).
1103125121 is an equidigital number, since it uses as much as digits as its factorization.
1103125121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9269983.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1103125121 is about 33213.3274605240. The cubic root of 1103125121 is about 1033.2567669826.
Adding to 1103125121 its reverse (1215213011), we get a palindrome (2318338132).
The spelling of 1103125121 in words is "one billion, one hundred three million, one hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •