Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …1100001110110010010101 |
3 | 1022110001101221000000111120 |
4 | 2101223210030032302111 |
5 | 2303010214131224341 |
6 | 33143011543554153 |
7 | 2052164305522116 |
oct | 221534414166225 |
9 | 38401357000446 |
10 | 10011102211221 |
11 | 320a7592336a1 |
12 | 1158275a5b959 |
13 | 5780732bbc87 |
14 | 26877b80820d |
15 | 125629972066 |
hex | 91ae430ec95 |
10011102211221 has 8 divisors (see below), whose sum is σ = 13708896721824. Its totient is φ = 6493687920720.
The previous prime is 10011102211189. The next prime is 10011102211241. The reversal of 10011102211221 is 12211220111001.
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 10011102211221 - 25 = 10011102211189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10011102211221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011102211241) 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, 45095054895 + ... + 45095055116.
It is an arithmetic number, because the mean of its divisors is an integer number (1713612090228).
Almost surely, 210011102211221 is an apocalyptic number.
It is an amenable number.
10011102211221 is a deficient number, since it is larger than the sum of its proper divisors (3697794510603).
10011102211221 is an equidigital number, since it uses as much as digits as its factorization.
10011102211221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90190110051.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10011102211221 its reverse (12211220111001), we get a palindrome (22222322322222).
The spelling of 10011102211221 in words is "ten trillion, eleven billion, one hundred two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •