Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …10110101001010001010101 |
3 | 2122121012112210120210220121 |
4 | 10212101031312221101111 |
5 | 10122304140110400041 |
6 | 111001510354031541 |
7 | 4154664212416102 |
oct | 446211566512125 |
9 | 78535483523817 |
10 | 20222012200021 |
11 | 649711a777985 |
12 | 23271b2b785b1 |
13 | b38c09b36c28 |
14 | 4dca71977aa9 |
15 | 25104aa487d1 |
hex | 12644dda9455 |
20222012200021 has 8 divisors (see below), whose sum is σ = 21423524198400. Its totient is φ = 19021831520448.
The previous prime is 20222012200003. The next prime is 20222012200073. The reversal of 20222012200021 is 12000221022202.
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 20222012200021 - 217 = 20222012068949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20222012199968 and 20222012200004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222012200081) 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, 332798421 + ... + 332859178.
It is an arithmetic number, because the mean of its divisors is an integer number (2677940524800).
Almost surely, 220222012200021 is an apocalyptic number.
It is an amenable number.
20222012200021 is a deficient number, since it is larger than the sum of its proper divisors (1201511998379).
20222012200021 is a wasteful number, since it uses less digits than its factorization.
20222012200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665659403.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20222012200021 its reverse (12000221022202), we get a palindrome (32222233222223).
The spelling of 20222012200021 in words is "twenty trillion, two hundred twenty-two billion, twelve million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •