Base | Representation |
---|---|
bin | 11101011101011010000… |
… | …00111100010110001111 |
3 | 10120202201100112202200111 |
4 | 32232231000330112033 |
5 | 113041011311120421 |
6 | 2053001335540451 |
7 | 133062520131556 |
oct | 16565500742617 |
9 | 3522640482614 |
10 | 1012220020111 |
11 | 3603098a3973 |
12 | 14421252a727 |
13 | 745b4ba6c81 |
14 | 36dc5378d9d |
15 | 1b4e4497ee1 |
hex | ebad03c58f |
1012220020111 has 8 divisors (see below), whose sum is σ = 1016495133104. Its totient is φ = 1007945527680.
The previous prime is 1012220020079. The next prime is 1012220020243. The reversal of 1012220020111 is 1110200222101.
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 1012220020111 - 25 = 1012220020079 is a prime.
It is a super-2 number, since 2×10122200201112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012220020091 and 1012220020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012220020411) 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, 3273556 + ... + 3569398.
It is an arithmetic number, because the mean of its divisors is an integer number (127061891638).
Almost surely, 21012220020111 is an apocalyptic number.
1012220020111 is a deficient number, since it is larger than the sum of its proper divisors (4275112993).
1012220020111 is a wasteful number, since it uses less digits than its factorization.
1012220020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310281.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1012220020111 its reverse (1110200222101), we get a palindrome (2122420242212).
The spelling of 1012220020111 in words is "one trillion, twelve billion, two hundred twenty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •