Base | Representation |
---|---|
bin | 10000000011010001111… |
… | …001101110110110000101 |
3 | 10220110010021120021220200 |
4 | 100003101321232312011 |
5 | 121033002444400010 |
6 | 2202420525321113 |
7 | 142456122334152 |
oct | 20032171566605 |
9 | 3813107507820 |
10 | 1103033200005 |
11 | 395880538060 |
12 | 159937706199 |
13 | 80028315189 |
14 | 3b55c273229 |
15 | 1da5be01cc0 |
hex | 100d1e6ed85 |
1103033200005 has 24 divisors (see below), whose sum is σ = 2085735506400. Its totient is φ = 534803975520.
The previous prime is 1103033200001. The next prime is 1103033200039. The reversal of 1103033200005 is 5000023303011.
It is not a de Polignac number, because 1103033200005 - 22 = 1103033200001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103033200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1114174455 + ... + 1114175444.
It is an arithmetic number, because the mean of its divisors is an integer number (86905646100).
Almost surely, 21103033200005 is an apocalyptic number.
1103033200005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1103033200005 is a deficient number, since it is larger than the sum of its proper divisors (982702306395).
1103033200005 is a wasteful number, since it uses less digits than its factorization.
1103033200005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228349921 (or 2228349918 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
Adding to 1103033200005 its reverse (5000023303011), we get a palindrome (6103056503016).
The spelling of 1103033200005 in words is "one trillion, one hundred three billion, thirty-three million, two hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •