Base | Representation |
---|---|
bin | 1010000111010101101101… |
… | …0011101000001001110001 |
3 | 1110101011202200222102211021 |
4 | 2201311123103220021301 |
5 | 2424202210230414301 |
6 | 35353002035215441 |
7 | 2225323520662441 |
oct | 241653323501161 |
9 | 43334680872737 |
10 | 11121202201201 |
11 | 35a8525793644 |
12 | 12b7444147581 |
13 | 6289566c3781 |
14 | 2a63aa422121 |
15 | 14444be828a1 |
hex | a1d5b4e8271 |
11121202201201 has 8 divisors (see below), whose sum is σ = 11619745341120. Its totient is φ = 10623910112112.
The previous prime is 11121202201199. The next prime is 11121202201223. The reversal of 11121202201201 is 10210220212111.
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 11121202201201 - 21 = 11121202201199 is a prime.
It is a super-2 number, since 2×111212022012012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121202201801) 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, 312744531 + ... + 312780088.
It is an arithmetic number, because the mean of its divisors is an integer number (1452468167640).
Almost surely, 211121202201201 is an apocalyptic number.
It is an amenable number.
11121202201201 is a deficient number, since it is larger than the sum of its proper divisors (498543139919).
11121202201201 is an equidigital number, since it uses as much as digits as its factorization.
11121202201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625525415.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11121202201201 its reverse (10210220212111), we get a palindrome (21331422413312).
The spelling of 11121202201201 in words is "eleven trillion, one hundred twenty-one billion, two hundred two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •