Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11000110100001110110 |
3 | 10121111210121212111221101 |
4 | 32311330303012201312 |
5 | 113202430230120042 |
6 | 2100325413440314 |
7 | 133456401421525 |
oct | 16657463064166 |
9 | 3544717774841 |
10 | 1020001020022 |
11 | 363641a91306 |
12 | 14582434009a |
13 | 75254c3c82a |
14 | 375229164bc |
15 | 1b7ec6346b7 |
hex | ed7ccc6876 |
1020001020022 has 8 divisors (see below), whose sum is σ = 1565582961096. Its totient is φ = 498140032992.
The previous prime is 1020001020011. The next prime is 1020001020029. The reversal of 1020001020022 is 2200201000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1020001019990 and 1020001020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020001020029) 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 3 ways as a sum of consecutive naturals, for example, 5930238403 + ... + 5930238574.
It is an arithmetic number, because the mean of its divisors is an integer number (195697870137).
Almost surely, 21020001020022 is an apocalyptic number.
1020001020022 is a deficient number, since it is larger than the sum of its proper divisors (545581941074).
1020001020022 is a wasteful number, since it uses less digits than its factorization.
1020001020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11860477022.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 1020001020022 its reverse (2200201000201), we get a palindrome (3220202020223).
The spelling of 1020001020022 in words is "one trillion, twenty billion, one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •