Base | Representation |
---|---|
bin | 1001001011111101100001… |
… | …11101001101101101000101 |
3 | 2122112022102001111021222112 |
4 | 10211332300331031231011 |
5 | 10121443101201430041 |
6 | 110544432414310405 |
7 | 4153363230641402 |
oct | 445766075155505 |
9 | 78468361437875 |
10 | 20202200030021 |
11 | 6489783279369 |
12 | 23233a3ab8405 |
13 | b370a0345109 |
14 | 4dbb125c72a9 |
15 | 25078b530deb |
hex | 125fb0f4db45 |
20202200030021 has 8 divisors (see below), whose sum is σ = 20214723892704. Its totient is φ = 20189677097520.
The previous prime is 20202200029889. The next prime is 20202200030053. The reversal of 20202200030021 is 12003000220202.
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 20202200030021 - 242 = 15804153518917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20202200029978 and 20202200030005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202200033021) 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, 46063250 + ... + 46499756.
It is an arithmetic number, because the mean of its divisors is an integer number (2526840486588).
Almost surely, 220202200030021 is an apocalyptic number.
It is an amenable number.
20202200030021 is a deficient number, since it is larger than the sum of its proper divisors (12523862683).
20202200030021 is a wasteful number, since it uses less digits than its factorization.
20202200030021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465091.
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 20202200030021 its reverse (12003000220202), we get a palindrome (32205200250223).
The spelling of 20202200030021 in words is "twenty trillion, two hundred two billion, two hundred million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •