Base | Representation |
---|---|
bin | 1001001001010010001010… |
… | …10100111111110111111001 |
3 | 2122012111221102020011022002 |
4 | 10210221011110333313321 |
5 | 10113441142200343111 |
6 | 110434255350510345 |
7 | 4143625334460341 |
oct | 444510524776771 |
9 | 78174842204262 |
10 | 20110200012281 |
11 | 64537626a9355 |
12 | 23095a93653b5 |
13 | b2b4cb0706b2 |
14 | 4d74a5c27d21 |
15 | 24d1a47db63b |
hex | 124a4553fdf9 |
20110200012281 has 2 divisors, whose sum is σ = 20110200012282. Its totient is φ = 20110200012280.
The previous prime is 20110200012223. The next prime is 20110200012323. The reversal of 20110200012281 is 18221000201102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18489312006400 + 1620888005881 = 4299920^2 + 1273141^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110200012281 is a prime.
It is a super-2 number, since 2×201102000122812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20110200015281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055100006140 + 10055100006141.
It is an arithmetic number, because the mean of its divisors is an integer number (10055100006141).
Almost surely, 220110200012281 is an apocalyptic number.
It is an amenable number.
20110200012281 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110200012281 is an equidigital number, since it uses as much as digits as its factorization.
20110200012281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 20110200012281 its reverse (18221000201102), we get a palindrome (38331200213383).
The spelling of 20110200012281 in words is "twenty trillion, one hundred ten billion, two hundred million, twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •