Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …1011100010110110010001 |
3 | 1110200200111100002022001001 |
4 | 2203020110023202312101 |
5 | 2432131444010310301 |
6 | 35501521331542001 |
7 | 2234624200051516 |
oct | 243102413426621 |
9 | 43620440068031 |
10 | 11210203213201 |
11 | 3632247512213 |
12 | 131074245a901 |
13 | 63416b571395 |
14 | 2aa81079730d |
15 | 14690a77cc01 |
hex | a32142e2d91 |
11210203213201 has 8 divisors (see below), whose sum is σ = 11714967437184. Its totient is φ = 10716532708560.
The previous prime is 11210203213061. The next prime is 11210203213207. The reversal of 11210203213201 is 10231230201211.
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 11210203213201 - 219 = 11210202688913 is a prime.
It is a super-4 number, since 4×112102032132014 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11210203213207) 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, 2773427770 + ... + 2773431811.
It is an arithmetic number, because the mean of its divisors is an integer number (1464370929648).
Almost surely, 211210203213201 is an apocalyptic number.
It is an amenable number.
11210203213201 is a deficient number, since it is larger than the sum of its proper divisors (504764223983).
11210203213201 is an equidigital number, since it uses as much as digits as its factorization.
11210203213201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5546859671.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11210203213201 its reverse (10231230201211), we get a palindrome (21441433414412).
The spelling of 11210203213201 in words is "eleven trillion, two hundred ten billion, two hundred three million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.320 sec. • engine limits •