Base | Representation |
---|---|
bin | 100000111000011… |
… | …0010110011000101 |
3 | 2211220001221211010 |
4 | 1001300302303011 |
5 | 4224421410041 |
6 | 301251432433 |
7 | 36224660202 |
oct | 10160626305 |
9 | 2756057733 |
10 | 1103310021 |
11 | 516876170 |
12 | 2695b5719 |
13 | 14776c488 |
14 | a6760ca9 |
15 | 66cdba16 |
hex | 41c32cc5 |
1103310021 has 16 divisors (see below), whose sum is σ = 1605372480. Its totient is φ = 668440320.
The previous prime is 1103310011. The next prime is 1103310037. The reversal of 1103310021 is 1200133011.
It is not a de Polignac number, because 1103310021 - 217 = 1103178949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1103309979 and 1103310006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103310001) 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 15 ways as a sum of consecutive naturals, for example, 169495 + ... + 175883.
It is an arithmetic number, because the mean of its divisors is an integer number (100335780).
Almost surely, 21103310021 is an apocalyptic number.
1103310021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1103310021 is a deficient number, since it is larger than the sum of its proper divisors (502062459).
1103310021 is a wasteful number, since it uses less digits than its factorization.
1103310021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11636.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1103310021 is about 33216.1108650606. The cubic root of 1103310021 is about 1033.3144934361.
Adding to 1103310021 its reverse (1200133011), we get a palindrome (2303443032).
The spelling of 1103310021 in words is "one billion, one hundred three million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •