Base | Representation |
---|---|
bin | 10110111101101111110010… |
… | …010011101000111011100101 |
3 | 111020121112020001222002021002 |
4 | 112331233302103220323211 |
5 | 101214241423111400401 |
6 | 554450505554203045 |
7 | 30163011431103446 |
oct | 2675576223507345 |
9 | 436545201862232 |
10 | 101000221200101 |
11 | 2a1aaa53884a73 |
12 | b3b2629883485 |
13 | 44483841ac502 |
14 | 1ad26187992cd |
15 | ba23aa67ba6b |
hex | 5bdbf24e8ee5 |
101000221200101 has 2 divisors, whose sum is σ = 101000221200102. Its totient is φ = 101000221200100.
The previous prime is 101000221200079. The next prime is 101000221200119. The reversal of 101000221200101 is 101002122000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77891674291876 + 23108546908225 = 8825626^2 + 4807135^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000221200101 - 222 = 101000217005797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000220200101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500110600050 + 50500110600051.
It is an arithmetic number, because the mean of its divisors is an integer number (50500110600051).
Almost surely, 2101000221200101 is an apocalyptic number.
It is an amenable number.
101000221200101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000221200101 is an equidigital number, since it uses as much as digits as its factorization.
101000221200101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101000221200101 its reverse (101002122000101), we get a palindrome (202002343200202).
The spelling of 101000221200101 in words is "one hundred one trillion, two hundred twenty-one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •