Base | Representation |
---|---|
bin | 10110110010011010000101… |
… | …101101101001011111001001 |
3 | 111010212000221112001000201111 |
4 | 112302122011231221133021 |
5 | 101114010112104033001 |
6 | 553052521350450321 |
7 | 30052505030054005 |
oct | 2662320555513711 |
9 | 433760845030644 |
10 | 100221010221001 |
11 | 29a2a54557138a |
12 | b2a76056639a1 |
13 | 43bca54218247 |
14 | 1aa6a19427705 |
15 | b8bea250e851 |
hex | 5b2685b697c9 |
100221010221001 has 2 divisors, whose sum is σ = 100221010221002. Its totient is φ = 100221010221000.
The previous prime is 100221010220983. The next prime is 100221010221037. The reversal of 100221010221001 is 100122010122001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91824785375625 + 8396224845376 = 9582525^2 + 2897624^2 .
It is a cyclic number.
It is not a de Polignac number, because 100221010221001 - 213 = 100221010212809 is a prime.
It is a super-2 number, since 2×1002210102210012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100221010221071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110505110500 + 50110505110501.
It is an arithmetic number, because the mean of its divisors is an integer number (50110505110501).
Almost surely, 2100221010221001 is an apocalyptic number.
It is an amenable number.
100221010221001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100221010221001 is an equidigital number, since it uses as much as digits as its factorization.
100221010221001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100221010221001 its reverse (100122010122001), we get a palindrome (200343020343002).
The spelling of 100221010221001 in words is "one hundred trillion, two hundred twenty-one billion, ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •