Base | Representation |
---|---|
bin | 10000001010101101011… |
… | …010101100110011110101 |
3 | 10221012201021020112121002 |
4 | 100022231122230303311 |
5 | 121200322310120041 |
6 | 2210220313533045 |
7 | 143160613565510 |
oct | 20125532546365 |
9 | 3835637215532 |
10 | 1111011020021 |
11 | 3991a4836341 |
12 | 15b3a3414185 |
13 | 809ca090836 |
14 | 3bab7a05d77 |
15 | 1dd774ba59b |
hex | 102ad6accf5 |
1111011020021 has 12 divisors (see below), whose sum is σ = 1348810217568. Its totient is φ = 896277796032.
The previous prime is 1111011020017. The next prime is 1111011020023. The reversal of 1111011020021 is 1200201101111.
It is not a de Polignac number, because 1111011020021 - 22 = 1111011020017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111011019984 and 1111011020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111011020023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 274592891 + ... + 274596936.
It is an arithmetic number, because the mean of its divisors is an integer number (112400851464).
Almost surely, 21111011020021 is an apocalyptic number.
It is an amenable number.
1111011020021 is a deficient number, since it is larger than the sum of its proper divisors (237799197547).
1111011020021 is an equidigital number, since it uses as much as digits as its factorization.
1111011020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549189868 (or 549189851 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1111011020021 its reverse (1200201101111), we get a palindrome (2311212121132).
The spelling of 1111011020021 in words is "one trillion, one hundred eleven billion, eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •