Base | Representation |
---|---|
bin | 10111000000111101011011… |
… | …000011110110110000101110 |
3 | 111021101122011001122000000001 |
4 | 113000331123003312300232 |
5 | 101231401123113032342 |
6 | 555140143501454514 |
7 | 30214656200001433 |
oct | 2700753303666056 |
9 | 437348131560001 |
10 | 101221022002222 |
11 | 2a28565a103721 |
12 | b42938b57143a |
13 | 4463141a7a305 |
14 | 1add1a3259b8a |
15 | ba7eced018b7 |
hex | 5c0f5b0f6c2e |
101221022002222 has 8 divisors (see below), whose sum is σ = 152483170484736. Its totient is φ = 50393298507312.
The previous prime is 101221022002213. The next prime is 101221022002223. The reversal of 101221022002222 is 222200220122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 101221022002222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221022002223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108606246318 + ... + 108606247249.
It is an arithmetic number, because the mean of its divisors is an integer number (19060396310592).
Almost surely, 2101221022002222 is an apocalyptic number.
101221022002222 is a deficient number, since it is larger than the sum of its proper divisors (51262148482514).
101221022002222 is a wasteful number, since it uses less digits than its factorization.
101221022002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217212493802.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 101221022002222 its reverse (222200220122101), we get a palindrome (323421242124323).
It can be divided in two parts, 10122102 and 2002222, that added together give a square (12124324 = 34822).
The spelling of 101221022002222 in words is "one hundred one trillion, two hundred twenty-one billion, twenty-two million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •