Base | Representation |
---|---|
bin | 10000000000011110111… |
… | …010100111111001000011 |
3 | 10220011101000002202222112 |
4 | 100000132322213321003 |
5 | 121010330224441003 |
6 | 2201202535125535 |
7 | 142321530242510 |
oct | 20003672477103 |
9 | 3804330082875 |
10 | 1100030312003 |
11 | 39457a484937 |
12 | 159239b138ab |
13 | 7c96a15c27c |
14 | 3b355518307 |
15 | 1d93348c3d8 |
hex | 1001eea7e43 |
1100030312003 has 8 divisors (see below), whose sum is σ = 1257836758272. Its totient is φ = 942388680456.
The previous prime is 1100030311979. The next prime is 1100030312039. The reversal of 1100030312003 is 3002130300011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100030312003 is a prime.
It is a super-3 number, since 3×11000303120033 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100030312063) 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 7 ways as a sum of consecutive naturals, for example, 41189375 + ... + 41216072.
It is an arithmetic number, because the mean of its divisors is an integer number (157229594784).
Almost surely, 21100030312003 is an apocalyptic number.
1100030312003 is a deficient number, since it is larger than the sum of its proper divisors (157806446269).
1100030312003 is an equidigital number, since it uses as much as digits as its factorization.
1100030312003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82407361.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1100030312003 its reverse (3002130300011), we get a palindrome (4102160612014).
The spelling of 1100030312003 in words is "one trillion, one hundred billion, thirty million, three hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •