Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …0010011000010111001001 |
3 | 1110022021012010100010011120 |
4 | 2201202310102120113021 |
5 | 2423340244333210441 |
6 | 35335455151545453 |
7 | 2224015404602616 |
oct | 241426422302711 |
9 | 43267163303146 |
10 | 11101220210121 |
11 | 35a0001444a28 |
12 | 12b35a822b289 |
13 | 626ac0982c02 |
14 | 2a54326a750d |
15 | 143b7cac2966 |
hex | a18b44985c9 |
11101220210121 has 8 divisors (see below), whose sum is σ = 14866262873280. Its totient is φ = 7368495510192.
The previous prime is 11101220210089. The next prime is 11101220210183. The reversal of 11101220210121 is 12101202210111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11101220210121 - 25 = 11101220210089 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11101220210121.
It is not an unprimeable number, because it can be changed into a prime (11101220210621) 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, 8079490005 + ... + 8079491378.
It is an arithmetic number, because the mean of its divisors is an integer number (1858282859160).
Almost surely, 211101220210121 is an apocalyptic number.
It is an amenable number.
11101220210121 is a deficient number, since it is larger than the sum of its proper divisors (3765042663159).
11101220210121 is a wasteful number, since it uses less digits than its factorization.
11101220210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16158981615.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11101220210121 its reverse (12101202210111), we get a palindrome (23202422420232).
The spelling of 11101220210121 in words is "eleven trillion, one hundred one billion, two hundred twenty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •