Base | Representation |
---|---|
bin | 11101101100001010000… |
… | …00011110110100010111 |
3 | 10121112011020000200020121 |
4 | 32312011000132310113 |
5 | 113203221004320421 |
6 | 2100351213412411 |
7 | 133462663155433 |
oct | 16660500366427 |
9 | 3545136020217 |
10 | 1020138745111 |
11 | 3637027aa1a2 |
12 | 14586249a107 |
13 | 75277631575 |
14 | 37536d279c3 |
15 | 1b80978bd41 |
hex | ed8501ed17 |
1020138745111 has 8 divisors (see below), whose sum is σ = 1022413392000. Its totient is φ = 1017865805880.
The previous prime is 1020138745013. The next prime is 1020138745147. The reversal of 1020138745111 is 1115478310201.
1020138745111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020138745111 - 227 = 1020004527383 is a prime.
It is a super-3 number, since 3×10201387451113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020138743111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 772950 + ... + 1624108.
It is an arithmetic number, because the mean of its divisors is an integer number (127801674000).
Almost surely, 21020138745111 is an apocalyptic number.
1020138745111 is a deficient number, since it is larger than the sum of its proper divisors (2274646889).
1020138745111 is an equidigital number, since it uses as much as digits as its factorization.
1020138745111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 853829.
The product of its (nonzero) digits is 6720, while the sum is 34.
The spelling of 1020138745111 in words is "one trillion, twenty billion, one hundred thirty-eight million, seven hundred forty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •