Base | Representation |
---|---|
bin | 11101101100001000000… |
… | …00101001100101101011 |
3 | 10121112010001112112202011 |
4 | 32312010000221211223 |
5 | 113203202213341021 |
6 | 2100345415020351 |
7 | 133462401014044 |
oct | 16660400514553 |
9 | 3545101475664 |
10 | 1020122012011 |
11 | 3636a4310393 |
12 | 14585896a6b7 |
13 | 7527402311b |
14 | 37534a0d8cb |
15 | 1b808083de1 |
hex | ed8402996b |
1020122012011 has 8 divisors (see below), whose sum is σ = 1064495615904. Its totient is φ = 975750114240.
The previous prime is 1020122011991. The next prime is 1020122012051. The reversal of 1020122012011 is 1102102210201.
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 1020122012011 - 227 = 1019987794283 is a prime.
It is a super-3 number, since 3×10201220120113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020122011982 and 1020122012000.
It is not an unprimeable number, because it can be changed into a prime (1020122012051) 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, 880575 + ... + 1677991.
It is an arithmetic number, because the mean of its divisors is an integer number (133061951988).
Almost surely, 21020122012011 is an apocalyptic number.
1020122012011 is a deficient number, since it is larger than the sum of its proper divisors (44373603893).
1020122012011 is an equidigital number, since it uses as much as digits as its factorization.
1020122012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 853061.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020122012011 its reverse (1102102210201), we get a palindrome (2122224222212).
The spelling of 1020122012011 in words is "one trillion, twenty billion, one hundred twenty-two million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •