Base | Representation |
---|---|
bin | 10110111110000011001110… |
… | …110110100011101001101101 |
3 | 111020200112010020101111110020 |
4 | 112332003032312203221231 |
5 | 101220112203402211341 |
6 | 554504241521232353 |
7 | 30164351030211513 |
oct | 2676031666435155 |
9 | 436615106344406 |
10 | 101021101210221 |
11 | 2a208899022685 |
12 | b3b66964926b9 |
13 | 444a330ca1b9a |
14 | 1ad36398b64b3 |
15 | ba2bcd7c6566 |
hex | 5be0ceda3a6d |
101021101210221 has 16 divisors (see below), whose sum is σ = 134716170662400. Its totient is φ = 67336716870720.
The previous prime is 101021101210187. The next prime is 101021101210229. The reversal of 101021101210221 is 122012101120101.
It is a happy number.
It is not a de Polignac number, because 101021101210221 - 29 = 101021101209709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101021101210221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021101210229) 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, 1073377956 + ... + 1073472066.
It is an arithmetic number, because the mean of its divisors is an integer number (8419760666400).
Almost surely, 2101021101210221 is an apocalyptic number.
It is an amenable number.
101021101210221 is a deficient number, since it is larger than the sum of its proper divisors (33695069452179).
101021101210221 is an equidigital number, since it uses as much as digits as its factorization.
101021101210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147076.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101021101210221 its reverse (122012101120101), we get a palindrome (223033202330322).
The spelling of 101021101210221 in words is "one hundred one trillion, twenty-one billion, one hundred one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •