Base | Representation |
---|---|
bin | 11101010000111000111… |
… | …10000110011100000011 |
3 | 10120010101000122101002212 |
4 | 32220130132012130003 |
5 | 112433231000000003 |
6 | 2045530442332335 |
7 | 132434140660322 |
oct | 16503436063403 |
9 | 3503330571085 |
10 | 1005500000003 |
11 | 35848059a344 |
12 | 142a57aba0ab |
13 | 73a838ac505 |
14 | 36948aa00b9 |
15 | 1b24e535dd8 |
hex | ea1c786703 |
1005500000003 has 4 divisors (see below), whose sum is σ = 1005503952648. Its totient is φ = 1005496047360.
The previous prime is 1005499999949. The next prime is 1005500000009. The reversal of 1005500000003 is 3000000055001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1005500000003 - 238 = 730622093059 is a prime.
It is a super-2 number, since 2×10055000000032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1005500000009) 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 3 ways as a sum of consecutive naturals, for example, 1566401 + ... + 2112962.
It is an arithmetic number, because the mean of its divisors is an integer number (251375988162).
Almost surely, 21005500000003 is an apocalyptic number.
1005500000003 is a deficient number, since it is larger than the sum of its proper divisors (3952645).
1005500000003 is an equidigital number, since it uses as much as digits as its factorization.
1005500000003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3952644.
The product of its (nonzero) digits is 75, while the sum is 14.
Adding to 1005500000003 its reverse (3000000055001), we get a palindrome (4005500055004).
The spelling of 1005500000003 in words is "one trillion, five billion, five hundred million, three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •