Base | Representation |
---|---|
bin | 10111000000111101011001… |
… | …110111100011111100101101 |
3 | 111021101122002122222220011021 |
4 | 113000331121313203330231 |
5 | 101231401103003032341 |
6 | 555140141505054141 |
7 | 30214655535002413 |
oct | 2700753167437455 |
9 | 437348078886137 |
10 | 101221002002221 |
11 | 2a2856498933a2 |
12 | b429384927351 |
13 | 446313a896baa |
14 | 1add1a07312b3 |
15 | ba7ecd1a09d1 |
hex | 5c0f59de3f2d |
101221002002221 has 16 divisors (see below), whose sum is σ = 104865719378688. Its totient is φ = 97641913262400.
The previous prime is 101221002002161. The next prime is 101221002002251. The reversal of 101221002002221 is 122200200122101.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101221002002221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101221002002195 and 101221002002204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221002002251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1063020 + ... + 14267866.
It is an arithmetic number, because the mean of its divisors is an integer number (6554107461168).
Almost surely, 2101221002002221 is an apocalyptic number.
It is an amenable number.
101221002002221 is a deficient number, since it is larger than the sum of its proper divisors (3644717376467).
101221002002221 is a wasteful number, since it uses less digits than its factorization.
101221002002221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13207332.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101221002002221 its reverse (122200200122101), we get a palindrome (223421202124322).
The spelling of 101221002002221 in words is "one hundred one trillion, two hundred twenty-one billion, two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •