Base | Representation |
---|---|
bin | 1001001011111101100101… |
… | …10100100010101010101011 |
3 | 2122112022111020100112110000 |
4 | 10211332302310202222223 |
5 | 10121443132203423034 |
6 | 110544435452554043 |
7 | 4153364060553552 |
oct | 445766264425253 |
9 | 78468436315400 |
10 | 20202231311019 |
11 | 64897999a422a |
12 | 23233b2482923 |
13 | b370a6978194 |
14 | 4dbb1680ad99 |
15 | 25078e15e599 |
hex | 125fb2d22aab |
20202231311019 has 30 divisors (see below), whose sum is σ = 32058280463924. Its totient is φ = 12675909827520.
The previous prime is 20202231310997. The next prime is 20202231311051. The reversal of 20202231311019 is 91011313220202.
20202231311019 is a `hidden beast` number, since 20 + 202 + 2 + 313 + 110 + 19 = 666.
It is not a de Polignac number, because 20202231311019 - 221 = 20202229213867 is a prime.
It is a super-2 number, since 2×202022313110192 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20202231310983 and 20202231311001.
It is not an unprimeable number, because it can be changed into a prime (20202231311099) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 431482237 + ... + 431529054.
Almost surely, 220202231311019 is an apocalyptic number.
20202231311019 is a deficient number, since it is larger than the sum of its proper divisors (11856049152905).
20202231311019 is an equidigital number, since it uses as much as digits as its factorization.
20202231311019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 863011337 (or 863011311 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The spelling of 20202231311019 in words is "twenty trillion, two hundred two billion, two hundred thirty-one million, three hundred eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •