Base | Representation |
---|---|
bin | 1001001011111001101000… |
… | …11100001101000110100110 |
3 | 2122112010000110121200022011 |
4 | 10211330310130031012212 |
5 | 10121424311404031042 |
6 | 110543445231224434 |
7 | 4153260403332640 |
oct | 445746434150646 |
9 | 78463013550264 |
10 | 20200111002022 |
11 | 6488901054746 |
12 | 2322b0037811a |
13 | b36b295c9383 |
14 | 4db994d95890 |
15 | 2506b7e34a17 |
hex | 125f3470d1a6 |
20200111002022 has 8 divisors (see below), whose sum is σ = 34628761717776. Its totient is φ = 8657190429432.
The previous prime is 20200111002013. The next prime is 20200111002023. The reversal of 20200111002022 is 22020011100202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20200111001993 and 20200111002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200111002023) 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, 721432535773 + ... + 721432535800.
It is an arithmetic number, because the mean of its divisors is an integer number (4328595214722).
Almost surely, 220200111002022 is an apocalyptic number.
20200111002022 is a deficient number, since it is larger than the sum of its proper divisors (14428650715754).
20200111002022 is a wasteful number, since it uses less digits than its factorization.
20200111002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1442865071582.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20200111002022 its reverse (22020011100202), we get a palindrome (42220122102224).
It can be divided in two parts, 2020011100202 and 2, that multiplied together give a palindrome (4040022200404).
The spelling of 20200111002022 in words is "twenty trillion, two hundred billion, one hundred eleven million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •