Base | Representation |
---|---|
bin | 1010001100100101000011… |
… | …1001111100110101000001 |
3 | 1110200210010100010121011022 |
4 | 2203021100321330311001 |
5 | 2432141040313324301 |
6 | 35502210404155225 |
7 | 2234661350514212 |
oct | 243112071746501 |
9 | 43623110117138 |
10 | 11211222011201 |
11 | 363271a605233 |
12 | 1310987698b15 |
13 | 6342a1660834 |
14 | 2aa8a9bd9409 |
15 | 146969e23d1b |
hex | a3250e7cd41 |
11211222011201 has 8 divisors (see below), whose sum is σ = 11802863978400. Its totient is φ = 10619737809120.
The previous prime is 11211222011107. The next prime is 11211222011219. The reversal of 11211222011201 is 10211022211211.
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-11211222011201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11211222011201.
It is not an unprimeable number, because it can be changed into a prime (11211222011251) 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, 39295391 + ... + 39579668.
It is an arithmetic number, because the mean of its divisors is an integer number (1475357997300).
Almost surely, 211211222011201 is an apocalyptic number.
It is an amenable number.
11211222011201 is a deficient number, since it is larger than the sum of its proper divisors (591641967199).
11211222011201 is an equidigital number, since it uses as much as digits as its factorization.
11211222011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78882559.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11211222011201 its reverse (10211022211211), we get a palindrome (21422244222412).
The spelling of 11211222011201 in words is "eleven trillion, two hundred eleven billion, two hundred twenty-two million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •