Base | Representation |
---|---|
bin | 100001000001100… |
… | …0100010010011101 |
3 | 2212020002022210010 |
4 | 1002003010102131 |
5 | 4232133202003 |
6 | 301542233433 |
7 | 36313460661 |
oct | 10203042235 |
9 | 2766068703 |
10 | 1108100253 |
11 | 519548137 |
12 | 26b125879 |
13 | 148758930 |
14 | a724a8a1 |
15 | 67436003 |
hex | 420c449d |
1108100253 has 8 divisors (see below), whose sum is σ = 1591118368. Its totient is φ = 681907824.
The previous prime is 1108100249. The next prime is 1108100269. The reversal of 1108100253 is 3520018011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1108100253 - 22 = 1108100249 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 (1108100293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14206375 + ... + 14206452.
It is an arithmetic number, because the mean of its divisors is an integer number (198889796).
Almost surely, 21108100253 is an apocalyptic number.
1108100253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1108100253 is a deficient number, since it is larger than the sum of its proper divisors (483018115).
1108100253 is a wasteful number, since it uses less digits than its factorization.
1108100253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28412843.
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 1108100253 is about 33288.1398248686. The cubic root of 1108100253 is about 1034.8077787207.
Adding to 1108100253 its reverse (3520018011), we get a palindrome (4628118264).
The spelling of 1108100253 in words is "one billion, one hundred eight million, one hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •