Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11000010001000010001 |
3 | 10121111210121211121012221 |
4 | 32311330303002020101 |
5 | 113202430224031001 |
6 | 2100325413221041 |
7 | 133456401315142 |
oct | 16657463021021 |
9 | 3544717747187 |
10 | 1020001002001 |
11 | 363641a79813 |
12 | 145824331781 |
13 | 75254c34577 |
14 | 3752290dac9 |
15 | 1b7ec62e1a1 |
hex | ed7ccc2211 |
1020001002001 has 8 divisors (see below), whose sum is σ = 1020732549408. Its totient is φ = 1019269644000.
The previous prime is 1020001001969. The next prime is 1020001002011. The reversal of 1020001002001 is 1002001000201.
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 1020001002001 - 25 = 1020001001969 is a prime.
It is a super-3 number, since 3×10200010020013 (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 (1020001002011) 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, 11766346 + ... + 11852716.
It is an arithmetic number, because the mean of its divisors is an integer number (127591568676).
Almost surely, 21020001002001 is an apocalyptic number.
It is an amenable number.
1020001002001 is a deficient number, since it is larger than the sum of its proper divisors (731547407).
1020001002001 is an equidigital number, since it uses as much as digits as its factorization.
1020001002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94703.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1020001002001 its reverse (1002001000201), we get a palindrome (2022002002202).
The spelling of 1020001002001 in words is "one trillion, twenty billion, one million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •