Base | Representation |
---|---|
bin | 11101101100000110110… |
… | …10011101101111010001 |
3 | 10121112002100200222121001 |
4 | 32312003122131233101 |
5 | 113203142133031001 |
6 | 2100344420302001 |
7 | 133462216643251 |
oct | 16660332355721 |
9 | 3545070628531 |
10 | 1020112002001 |
11 | 3636996a3754 |
12 | 145855541901 |
13 | 75271c29b41 |
14 | 37533565961 |
15 | 1b807258001 |
hex | ed8369dbd1 |
1020112002001 has 8 divisors (see below), whose sum is σ = 1080199635840. Its totient is φ = 960033373248.
The previous prime is 1020112001983. The next prime is 1020112002029. The reversal of 1020112002001 is 1002002110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020112002001 - 27 = 1020112001873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020112002031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2017341 + ... + 2471818.
It is an arithmetic number, because the mean of its divisors is an integer number (135024954480).
Almost surely, 21020112002001 is an apocalyptic number.
It is an amenable number.
1020112002001 is a deficient number, since it is larger than the sum of its proper divisors (60087633839).
1020112002001 is a wasteful number, since it uses less digits than its factorization.
1020112002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4502543.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1020112002001 its reverse (1002002110201), we get a palindrome (2022114112202).
It can be divided in two parts, 102011 and 2002001, that added together give a palindrome (2104012).
The spelling of 1020112002001 in words is "one trillion, twenty billion, one hundred twelve million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •