Base | Representation |
---|---|
bin | 11101101100000110100… |
… | …10111001110110101011 |
3 | 10121112002012222021211000 |
4 | 32312003102321312223 |
5 | 113203141131120021 |
6 | 2100344310010043 |
7 | 133462164046665 |
oct | 16660322716653 |
9 | 3545065867730 |
10 | 1020110020011 |
11 | 36369856a645 |
12 | 145854946923 |
13 | 752716b4974 |
14 | 375331ab535 |
15 | 1b806eb5b26 |
hex | ed834b9dab |
1020110020011 has 16 divisors (see below), whose sum is σ = 1511574220800. Its totient is φ = 679938294024.
The previous prime is 1020110019967. The next prime is 1020110020021. The reversal of 1020110020011 is 1100200110201.
It is a happy number.
It is not a de Polignac number, because 1020110020011 - 219 = 1020109495723 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1020110019975 and 1020110020002.
It is not an unprimeable number, because it can be changed into a prime (1020110020021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3612891 + ... + 3884996.
It is an arithmetic number, because the mean of its divisors is an integer number (94473388800).
Almost surely, 21020110020011 is an apocalyptic number.
1020110020011 is a deficient number, since it is larger than the sum of its proper divisors (491464200789).
1020110020011 is an equidigital number, since it uses as much as digits as its factorization.
1020110020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7502935 (or 7502929 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1020110020011 its reverse (1100200110201), we get a palindrome (2120310130212).
The spelling of 1020110020011 in words is "one trillion, twenty billion, one hundred ten million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •