Base | Representation |
---|---|
bin | 100000111000111… |
… | …1110100100111101 |
3 | 2211220122201121010 |
4 | 1001301332210331 |
5 | 4230011323123 |
6 | 301302225433 |
7 | 36230422140 |
oct | 10161764475 |
9 | 2756581533 |
10 | 1103620413 |
11 | 516a68395 |
12 | 269725279 |
13 | 14784a83c |
14 | a6802057 |
15 | 66d4d993 |
hex | 41c7e93d |
1103620413 has 16 divisors (see below), whose sum is σ = 1720818176. Its totient is φ = 615973680.
The previous prime is 1103620409. The next prime is 1103620421. The reversal of 1103620413 is 3140263011.
It is not a de Polignac number, because 1103620413 - 22 = 1103620409 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1103620413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103620403) 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 15 ways as a sum of consecutive naturals, for example, 610183 + ... + 611988.
It is an arithmetic number, because the mean of its divisors is an integer number (107551136).
Almost surely, 21103620413 is an apocalyptic number.
It is an amenable number.
1103620413 is a deficient number, since it is larger than the sum of its proper divisors (617197763).
1103620413 is a wasteful number, since it uses less digits than its factorization.
1103620413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1222224.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 1103620413 is about 33220.7828474887. The cubic root of 1103620413 is about 1033.4113844501.
Adding to 1103620413 its reverse (3140263011), we get a palindrome (4243883424).
The spelling of 1103620413 in words is "one billion, one hundred three million, six hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •