Base | Representation |
---|---|
bin | 1010001100000000001001… |
… | …0010011101110100010001 |
3 | 1110122211112202202220122202 |
4 | 2203000002102131310101 |
5 | 2432010242123244441 |
6 | 35453451234012545 |
7 | 2234160660263321 |
oct | 243000222356421 |
9 | 43584482686582 |
10 | 11201313103121 |
11 | 36294a52579a9 |
12 | 130aa81117155 |
13 | 6333827b830b |
14 | 2aa209bc9281 |
15 | 14658a05b19b |
hex | a300249dd11 |
11201313103121 has 8 divisors (see below), whose sum is σ = 11243088777024. Its totient is φ = 11159613455760.
The previous prime is 11201313103069. The next prime is 11201313103147. The reversal of 11201313103121 is 12130131310211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11201313103121 - 210 = 11201313102097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201313103093 and 11201313103102.
It is not an unprimeable number, because it can be changed into a prime (11201313103921) 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, 18711410 + ... + 19300763.
It is an arithmetic number, because the mean of its divisors is an integer number (1405386097128).
Almost surely, 211201313103121 is an apocalyptic number.
It is an amenable number.
11201313103121 is a deficient number, since it is larger than the sum of its proper divisors (41775673903).
11201313103121 is an equidigital number, since it uses as much as digits as its factorization.
11201313103121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38013271.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11201313103121 its reverse (12130131310211), we get a palindrome (23331444413332).
The spelling of 11201313103121 in words is "eleven trillion, two hundred one billion, three hundred thirteen million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •