Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …11101010111010100111001 |
3 | 2122121000212122102020202122 |
4 | 10212033201331113110321 |
5 | 10122241433204202301 |
6 | 111001011011411025 |
7 | 4154601312231536 |
oct | 446174175272471 |
9 | 78530778366678 |
10 | 20220202022201 |
11 | 64963809a1555 |
12 | 23269888b3a75 |
13 | b389abac23ac |
14 | 4dc93d3b1d8d |
15 | 250e91b7e81b |
hex | 1263e1f57539 |
20220202022201 has 8 divisors (see below), whose sum is σ = 20286541801344. Its totient is φ = 20153878304400.
The previous prime is 20220202022183. The next prime is 20220202022213. The reversal of 20220202022201 is 10222020202202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20220202022201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20220202022201.
It is not an unprimeable number, because it can be changed into a prime (20220202072201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1490735 + ... + 6531668.
It is an arithmetic number, because the mean of its divisors is an integer number (2535817725168).
Almost surely, 220220202022201 is an apocalyptic number.
It is an amenable number.
20220202022201 is a deficient number, since it is larger than the sum of its proper divisors (66339779143).
20220202022201 is an equidigital number, since it uses as much as digits as its factorization.
20220202022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8030671.
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 20220202022201 its reverse (10222020202202), we get a palindrome (30442222224403).
The spelling of 20220202022201 in words is "twenty trillion, two hundred twenty billion, two hundred two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •