Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …000110111001111000001 |
3 | 21010020202010120211120202 |
4 | 131100321000313033001 |
5 | 230422012303101311 |
6 | 4135501411214545 |
7 | 265201325230565 |
oct | 35207100671701 |
9 | 7106663524522 |
10 | 2011001222081 |
11 | 705951843865 |
12 | 2858b42a7455 |
13 | 1178377c9037 |
14 | 6d49399b6a5 |
15 | 3749dc0de3b |
hex | 1d4390373c1 |
2011001222081 has 2 divisors, whose sum is σ = 2011001222082. Its totient is φ = 2011001222080.
The previous prime is 2011001222059. The next prime is 2011001222093. The reversal of 2011001222081 is 1802221001102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1890050293681 + 120950928400 = 1374791^2 + 347780^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011001222081 - 226 = 2010934113217 is a prime.
It is a super-2 number, since 2×20110012220812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2011001222011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005500611040 + 1005500611041.
It is an arithmetic number, because the mean of its divisors is an integer number (1005500611041).
Almost surely, 22011001222081 is an apocalyptic number.
It is an amenable number.
2011001222081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011001222081 is an equidigital number, since it uses as much as digits as its factorization.
2011001222081 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 2011001222081 its reverse (1802221001102), we get a palindrome (3813222223183).
The spelling of 2011001222081 in words is "two trillion, eleven billion, one million, two hundred twenty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •