Base | Representation |
---|---|
bin | 1010010010011101010001… |
… | …0100011000001011110101 |
3 | 1111001102210102201212212121 |
4 | 2210213110110120023311 |
5 | 2440314402004031401 |
6 | 40020431420515541 |
7 | 2245165064002132 |
oct | 244472424301365 |
9 | 44042712655777 |
10 | 11312211002101 |
11 | 3671533224889 |
12 | 13284706abbb1 |
13 | 640977024499 |
14 | 2b172a33d589 |
15 | 1493cadb7ca1 |
hex | a49d45182f5 |
11312211002101 has 2 divisors, whose sum is σ = 11312211002102. Its totient is φ = 11312211002100.
The previous prime is 11312211002033. The next prime is 11312211002237. The reversal of 11312211002101 is 10120011221311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6452946270225 + 4859264731876 = 2540265^2 + 2204374^2 .
It is a cyclic number.
It is not a de Polignac number, because 11312211002101 - 211 = 11312211000053 is a prime.
It is a super-2 number, since 2×113122110021012 (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 (11312211092101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656105501050 + 5656105501051.
It is an arithmetic number, because the mean of its divisors is an integer number (5656105501051).
Almost surely, 211312211002101 is an apocalyptic number.
It is an amenable number.
11312211002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11312211002101 is an equidigital number, since it uses as much as digits as its factorization.
11312211002101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11312211002101 its reverse (10120011221311), we get a palindrome (21432222223412).
The spelling of 11312211002101 in words is "eleven trillion, three hundred twelve billion, two hundred eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •