Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1011111110001010100001 |
3 | 1110122210202000112112222220 |
4 | 2202333233223332022201 |
5 | 2432004122230201423 |
6 | 35453400245021253 |
7 | 2234150150526210 |
oct | 242775753761241 |
9 | 43583660475886 |
10 | 11201001022113 |
11 | 3629355081911 |
12 | 130a9b46b4829 |
13 | 633332c4a6b6 |
14 | 2aa1ba58d077 |
15 | 14656c9629e3 |
hex | a2fefafe2a1 |
11201001022113 has 16 divisors (see below), whose sum is σ = 17085555434496. Its totient is φ = 6394060737360.
The previous prime is 11201001022087. The next prime is 11201001022129. The reversal of 11201001022113 is 31122010010211.
It is not a de Polignac number, because 11201001022113 - 214 = 11201001005729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201001022092 and 11201001022101.
It is not an unprimeable number, because it can be changed into a prime (11201001062113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 271282003 + ... + 271323288.
It is an arithmetic number, because the mean of its divisors is an integer number (1067847214656).
Almost surely, 211201001022113 is an apocalyptic number.
It is an amenable number.
11201001022113 is a deficient number, since it is larger than the sum of its proper divisors (5884554412383).
11201001022113 is an equidigital number, since it uses as much as digits as its factorization.
11201001022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542606284.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11201001022113 its reverse (31122010010211), we get a palindrome (42323011032324).
The spelling of 11201001022113 in words is "eleven trillion, two hundred one billion, one million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •