Base | Representation |
---|---|
bin | 1001001011111101010110… |
… | …01100001110011110000111 |
3 | 2122112022011022111000010002 |
4 | 10211332223030032132013 |
5 | 10121442401421131043 |
6 | 110544415041151515 |
7 | 4153360644524516 |
oct | 445765314163607 |
9 | 78468138430102 |
10 | 20202103302023 |
11 | 6489733712175 |
12 | 232337762b59b |
13 | b370862a8a06 |
14 | 4dbb0380867d |
15 | 250782cc5bb8 |
hex | 125fab30e787 |
20202103302023 has 4 divisors (see below), whose sum is σ = 20671919657928. Its totient is φ = 19732286946120.
The previous prime is 20202103301983. The next prime is 20202103302053. The reversal of 20202103302023 is 32020330120202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20202103302023 - 230 = 20201029560199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20202103301986 and 20202103302004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202103302053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 234908177888 + ... + 234908177973.
It is an arithmetic number, because the mean of its divisors is an integer number (5167979914482).
Almost surely, 220202103302023 is an apocalyptic number.
20202103302023 is a deficient number, since it is larger than the sum of its proper divisors (469816355905).
20202103302023 is an equidigital number, since it uses as much as digits as its factorization.
20202103302023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469816355904.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 20202103302023 its reverse (32020330120202), we get a palindrome (52222433422225).
The spelling of 20202103302023 in words is "twenty trillion, two hundred two billion, one hundred three million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •