Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …00100111010011010111111 |
3 | 2122112002210012021121121102 |
4 | 10211330233010322122333 |
5 | 10121424120334310421 |
6 | 110543432254323315 |
7 | 4153255231402565 |
oct | 445745704723277 |
9 | 78462705247542 |
10 | 20200021010111 |
11 | 6488865279468 |
12 | 2322a961b953b |
13 | b36b13a7b017 |
14 | 4db98704ba35 |
15 | 2506b00aa60b |
hex | 125f2f13a6bf |
20200021010111 has 16 divisors (see below), whose sum is σ = 20839770685440. Its totient is φ = 19567736018880.
The previous prime is 20200021010093. The next prime is 20200021010189. The reversal of 20200021010111 is 11101012000202.
It is a cyclic number.
It is not a de Polignac number, because 20200021010111 - 218 = 20200020747967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20200021010092 and 20200021010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200021012111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 617510 + ... + 6386028.
It is an arithmetic number, because the mean of its divisors is an integer number (1302485667840).
Almost surely, 220200021010111 is an apocalyptic number.
20200021010111 is a deficient number, since it is larger than the sum of its proper divisors (639749675329).
20200021010111 is a wasteful number, since it uses less digits than its factorization.
20200021010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5769166.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20200021010111 its reverse (11101012000202), we get a palindrome (31301033010313).
Subtracting from 20200021010111 its reverse (11101012000202), we obtain a palindrome (9099009009909).
The spelling of 20200021010111 in words is "twenty trillion, two hundred billion, twenty-one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •