Base | Representation |
---|---|
bin | 100000111000101… |
… | …0101110000101001 |
3 | 2211220100020020222 |
4 | 1001301111300221 |
5 | 4224441000400 |
6 | 301254455425 |
7 | 36226124540 |
oct | 10161256051 |
9 | 2756306228 |
10 | 1103453225 |
11 | 516963816 |
12 | 269664575 |
13 | 1477bc704 |
14 | a679b157 |
15 | 66d19185 |
hex | 41c55c29 |
1103453225 has 24 divisors (see below), whose sum is σ = 1568762688. Its totient is φ = 754228800.
The previous prime is 1103453203. The next prime is 1103453227. The reversal of 1103453225 is 5223543011.
It is a happy number.
It is not a de Polignac number, because 1103453225 - 220 = 1102404649 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1103453194 and 1103453203.
It is not an unprimeable number, because it can be changed into a prime (1103453227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45530 + ... + 65420.
It is an arithmetic number, because the mean of its divisors is an integer number (65365112).
Almost surely, 21103453225 is an apocalyptic number.
It is an amenable number.
1103453225 is a deficient number, since it is larger than the sum of its proper divisors (465309463).
1103453225 is a wasteful number, since it uses less digits than its factorization.
1103453225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20225 (or 20220 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 1103453225 is about 33218.2664358031. The cubic root of 1103453225 is about 1033.3591978149.
Adding to 1103453225 its reverse (5223543011), we get a palindrome (6326996236).
The spelling of 1103453225 in words is "one billion, one hundred three million, four hundred fifty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •