Base | Representation |
---|---|
bin | 100000111010001… |
… | …1101011100010101 |
3 | 2211221212210012120 |
4 | 1001310131130111 |
5 | 4230143134000 |
6 | 301324210153 |
7 | 36236102226 |
oct | 10164353425 |
9 | 2757783176 |
10 | 1104271125 |
11 | 517372271 |
12 | 269999959 |
13 | 147a17a89 |
14 | a693124d |
15 | 66e2b6a0 |
hex | 41d1d715 |
1104271125 has 32 divisors (see below), whose sum is σ = 1945607040. Its totient is φ = 554297600.
The previous prime is 1104271123. The next prime is 1104271141. The reversal of 1104271125 is 5211724011.
It is not a de Polignac number, because 1104271125 - 21 = 1104271123 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1104271095 and 1104271104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104271123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80235 + ... + 92984.
It is an arithmetic number, because the mean of its divisors is an integer number (60800220).
Almost surely, 21104271125 is an apocalyptic number.
1104271125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1104271125 is a deficient number, since it is larger than the sum of its proper divisors (841335915).
1104271125 is a wasteful number, since it uses less digits than its factorization.
1104271125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173254 (or 173244 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 24.
The square root of 1104271125 is about 33230.5751530123. The cubic root of 1104271125 is about 1033.6144497617.
Adding to 1104271125 its reverse (5211724011), we get a palindrome (6315995136).
The spelling of 1104271125 in words is "one billion, one hundred four million, two hundred seventy-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •