Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …000100001100001110001 |
3 | 21011022122201212102112020 |
4 | 131123110220201201301 |
5 | 231112432204201001 |
6 | 4144553051222053 |
7 | 266046023402130 |
oct | 35332450414161 |
9 | 7138581772466 |
10 | 2022202022001 |
11 | 70a67a3605a7 |
12 | 287abb447929 |
13 | 1189011caab5 |
14 | 6dc373bb917 |
15 | 37907214736 |
hex | 1d6d4a21871 |
2022202022001 has 8 divisors (see below), whose sum is σ = 3081450700224. Its totient is φ = 1155544012560.
The previous prime is 2022202021997. The next prime is 2022202022033. The reversal of 2022202022001 is 1002202022202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2022202022001 - 22 = 2022202021997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2022202022041) 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, 48147667170 + ... + 48147667211.
It is an arithmetic number, because the mean of its divisors is an integer number (385181337528).
Almost surely, 22022202022001 is an apocalyptic number.
2022202022001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2022202022001 is a deficient number, since it is larger than the sum of its proper divisors (1059248678223).
2022202022001 is an equidigital number, since it uses as much as digits as its factorization.
2022202022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96295334391.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 2022202022001 its reverse (1002202022202), we get a palindrome (3024404044203).
The spelling of 2022202022001 in words is "two trillion, twenty-two billion, two hundred two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •