Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …1011101100001100101101 |
3 | 1022210121021010002012211211 |
4 | 2103020212223230030231 |
5 | 2311124313003032341 |
6 | 33300532531114421 |
7 | 2062332024655111 |
oct | 223104653541455 |
9 | 38717233065754 |
10 | 10111002002221 |
11 | 324906304523a |
12 | 11736b6142a11 |
13 | 584604113a43 |
14 | 26d537421741 |
15 | 128024eb5181 |
hex | 93226aec32d |
10111002002221 has 8 divisors (see below), whose sum is σ = 10425119769504. Its totient is φ = 9800474152560.
The previous prime is 10111002002161. The next prime is 10111002002263. The reversal of 10111002002221 is 12220020011101.
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 10111002002221 - 223 = 10110993613613 is a prime.
It is a super-2 number, since 2×101110020022212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111002302221) 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, 897473686 + ... + 897484951.
It is an arithmetic number, because the mean of its divisors is an integer number (1303139971188).
Almost surely, 210111002002221 is an apocalyptic number.
It is an amenable number.
10111002002221 is a deficient number, since it is larger than the sum of its proper divisors (314117767283).
10111002002221 is a wasteful number, since it uses less digits than its factorization.
10111002002221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794958811.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10111002002221 its reverse (12220020011101), we get a palindrome (22331022013322).
The spelling of 10111002002221 in words is "ten trillion, one hundred eleven billion, two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •