Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …001100100111111110010 |
3 | 21011022122121102220212020 |
4 | 131123110201210333302 |
5 | 231112431222414302 |
6 | 4144552544212310 |
7 | 266046002046516 |
oct | 35332441447762 |
9 | 7138577386766 |
10 | 2022200201202 |
11 | 70a679327605 |
12 | 287aba90a096 |
13 | 118900a110bc |
14 | 6dc37066146 |
15 | 37906ea4ebc |
hex | 1d6d4864ff2 |
2022200201202 has 8 divisors (see below), whose sum is σ = 4044400402416. Its totient is φ = 674066733732.
The previous prime is 2022200201191. The next prime is 2022200201213. The reversal of 2022200201202 is 2021020022202.
It is an interprime number because it is at equal distance from previous prime (2022200201191) and next prime (2022200201213).
It is a sphenic number, since it is the product of 3 distinct primes.
2022200201202 is an admirable number.
It is an unprimeable number.
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, 168516683428 + ... + 168516683439.
It is an arithmetic number, because the mean of its divisors is an integer number (505550050302).
Almost surely, 22022200201202 is an apocalyptic number.
2022200201202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022200201202 is a wasteful number, since it uses less digits than its factorization.
2022200201202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337033366872.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 2022200201202 its reverse (2021020022202), we get a palindrome (4043220223404).
The spelling of 2022200201202 in words is "two trillion, twenty-two billion, two hundred million, two hundred one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •