Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …10010111111100010001 |
3 | 10120002100220202200000020 |
4 | 32220011102113330101 |
5 | 112431431412100001 |
6 | 2045424110014053 |
7 | 132421405650312 |
oct | 16500522277421 |
9 | 3502326680006 |
10 | 1005111050001 |
11 | 3582a0a91463 |
12 | 1429697a7329 |
13 | 73a21139696 |
14 | 3690d174609 |
15 | 1b22a306736 |
hex | ea05497f11 |
1005111050001 has 8 divisors (see below), whose sum is σ = 1410682175520. Its totient is φ = 634806978912.
The previous prime is 1005111049991. The next prime is 1005111050003. The reversal of 1005111050001 is 1000501115001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1005111050001 - 221 = 1005108952849 is a prime.
It is a super-2 number, since 2×10051110500012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1005111050003) 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, 8816763540 + ... + 8816763653.
It is an arithmetic number, because the mean of its divisors is an integer number (176335271940).
Almost surely, 21005111050001 is an apocalyptic number.
It is an amenable number.
1005111050001 is a deficient number, since it is larger than the sum of its proper divisors (405571125519).
1005111050001 is a wasteful number, since it uses less digits than its factorization.
1005111050001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17633527215.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 1005111050001 its reverse (1000501115001), we get a palindrome (2005612165002).
The spelling of 1005111050001 in words is "one trillion, five billion, one hundred eleven million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •