Base | Representation |
---|---|
bin | 11101101111101001010… |
… | …10110101101111001011 |
3 | 10121200222210002222111011 |
4 | 32313310222311233023 |
5 | 113221040100320021 |
6 | 2101301134344351 |
7 | 133560261454021 |
oct | 16676452655713 |
9 | 3550883088434 |
10 | 1022012120011 |
11 | 36448421a513 |
12 | 1460a595b0b7 |
13 | 754b57a231c |
14 | 37673a60711 |
15 | 1b8b8e8ade1 |
hex | edf4ab5bcb |
1022012120011 has 4 divisors (see below), whose sum is σ = 1022014504792. Its totient is φ = 1022009735232.
The previous prime is 1022012119969. The next prime is 1022012120069. The reversal of 1022012120011 is 1100212102201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1022012120011 - 225 = 1021978565579 is a prime.
It is a super-4 number, since 4×10220121200114 (a number of 49 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022012119973 and 1022012120000.
It is not an unprimeable number, because it can be changed into a prime (1022012120611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 352230 + ... + 1472443.
It is an arithmetic number, because the mean of its divisors is an integer number (255503626198).
Almost surely, 21022012120011 is an apocalyptic number.
1022012120011 is a deficient number, since it is larger than the sum of its proper divisors (2384781).
1022012120011 is an equidigital number, since it uses as much as digits as its factorization.
1022012120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2384780.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1022012120011 its reverse (1100212102201), we get a palindrome (2122224222212).
The spelling of 1022012120011 in words is "one trillion, twenty-two billion, twelve million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •