Base | Representation |
---|---|
bin | 100000111000001… |
… | …0111111100000001 |
3 | 2211212212100220022 |
4 | 1001300113330001 |
5 | 4224404400001 |
6 | 301245223225 |
7 | 36224021351 |
oct | 10160277401 |
9 | 2755770808 |
10 | 1103200001 |
11 | 516800542 |
12 | 269561b15 |
13 | 147731387 |
14 | a6732b61 |
15 | 66cb911b |
hex | 41c17f01 |
1103200001 has 4 divisors (see below), whose sum is σ = 1103468292. Its totient is φ = 1102931712.
The previous prime is 1103199973. The next prime is 1103200013. The reversal of 1103200001 is 1000023011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 475196401 + 628003600 = 21799^2 + 25060^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103200001 - 226 = 1036091137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103200031) 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 3 ways as a sum of consecutive naturals, for example, 127880 + ... + 136233.
It is an arithmetic number, because the mean of its divisors is an integer number (275867073).
Almost surely, 21103200001 is an apocalyptic number.
It is an amenable number.
1103200001 is a deficient number, since it is larger than the sum of its proper divisors (268291).
1103200001 is an equidigital number, since it uses as much as digits as its factorization.
1103200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268290.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 1103200001 is about 33214.4546997237. The cubic root of 1103200001 is about 1033.2801455685.
Adding to 1103200001 its reverse (1000023011), we get a palindrome (2103223012).
The spelling of 1103200001 in words is "one billion, one hundred three million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •