Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …001111010011100011100101 |
3 | 111021000010011102212021100211 |
4 | 112333112331033103203211 |
5 | 101223100312001134341 |
6 | 555013430244535421 |
7 | 30204012560411431 |
oct | 2677267517234345 |
9 | 437003142767324 |
10 | 101111000021221 |
11 | 2a242a3060a9a3 |
12 | b40bba53b1571 |
13 | 4455959b553c8 |
14 | 1ad7b271939c1 |
15 | ba51e0d16181 |
hex | 5bf5bd3d38e5 |
101111000021221 has 2 divisors, whose sum is σ = 101111000021222. Its totient is φ = 101111000021220.
The previous prime is 101111000021219. The next prime is 101111000021233. The reversal of 101111000021221 is 122120000111101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88144195128196 + 12966804893025 = 9388514^2 + 3600945^2 .
It is a cyclic number.
It is not a de Polignac number, because 101111000021221 - 21 = 101111000021219 is a prime.
Together with 101111000021219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101111000027221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555500010610 + 50555500010611.
It is an arithmetic number, because the mean of its divisors is an integer number (50555500010611).
Almost surely, 2101111000021221 is an apocalyptic number.
It is an amenable number.
101111000021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111000021221 is an equidigital number, since it uses as much as digits as its factorization.
101111000021221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101111000021221 its reverse (122120000111101), we get a palindrome (223231000132322).
The spelling of 101111000021221 in words is "one hundred one trillion, one hundred eleven billion, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •