Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000110101100000010101 |
3 | 1110122210201221222210120011 |
4 | 2202333233220311200111 |
5 | 2432004122022401323 |
6 | 35453400215240221 |
7 | 2234150140534045 |
oct | 242775750654025 |
9 | 43583657883504 |
10 | 11201000200213 |
11 | 362935467035a |
12 | 130a9b4379071 |
13 | 633332a20575 |
14 | 2aa1ba417725 |
15 | 14656c84e20d |
hex | a2fefa35815 |
11201000200213 has 8 divisors (see below), whose sum is σ = 11876588766720. Its totient is φ = 10534017857760.
The previous prime is 11201000200199. The next prime is 11201000200231. The reversal of 11201000200213 is 31200200010211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201000200213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201000200193 and 11201000200202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201000200613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2151553333 + ... + 2151558538.
It is an arithmetic number, because the mean of its divisors is an integer number (1484573595840).
Almost surely, 211201000200213 is an apocalyptic number.
It is an amenable number.
11201000200213 is a deficient number, since it is larger than the sum of its proper divisors (675588566507).
11201000200213 is a wasteful number, since it uses less digits than its factorization.
11201000200213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4303112027.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11201000200213 its reverse (31200200010211), we get a palindrome (42401200210424).
The spelling of 11201000200213 in words is "eleven trillion, two hundred one billion, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •