Base | Representation |
---|---|
bin | 1001001000111111010111… |
… | …11010101100101100000101 |
3 | 2122011112220020002222211011 |
4 | 10210133223322230230011 |
5 | 10113310011130324031 |
6 | 110425510231042221 |
7 | 4143120315046366 |
oct | 444375372545405 |
9 | 78145806088734 |
10 | 20100110011141 |
11 | 644a455102136 |
12 | 2307652210371 |
13 | b2a580830914 |
14 | 4d6bc9b57b6d |
15 | 24ccb3aa16b1 |
hex | 1247ebeacb05 |
20100110011141 has 2 divisors, whose sum is σ = 20100110011142. Its totient is φ = 20100110011140.
The previous prime is 20100110011097. The next prime is 20100110011181. The reversal of 20100110011141 is 14111001100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17409046932225 + 2691063078916 = 4172415^2 + 1640446^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100110011141 - 27 = 20100110011013 is a prime.
It is a super-2 number, since 2×201001100111412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100110011181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050055005570 + 10050055005571.
It is an arithmetic number, because the mean of its divisors is an integer number (10050055005571).
Almost surely, 220100110011141 is an apocalyptic number.
It is an amenable number.
20100110011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100110011141 is an equidigital number, since it uses as much as digits as its factorization.
20100110011141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20100110011141 its reverse (14111001100102), we get a palindrome (34211111111243).
The spelling of 20100110011141 in words is "twenty trillion, one hundred billion, one hundred ten million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •