Base | Representation |
---|---|
bin | 101111000010101010… |
… | …1011000000011111101 |
3 | 100122202100020202021001 |
4 | 1132011111120003331 |
5 | 3123342413033432 |
6 | 114224123210301 |
7 | 10204254132355 |
oct | 1360525300375 |
9 | 318670222231 |
10 | 101021221117 |
11 | 3992a9336a3 |
12 | 176b3976991 |
13 | 96ac269aab |
14 | 4c64933b65 |
15 | 2963c0d9e7 |
hex | 17855580fd |
101021221117 has 2 divisors, whose sum is σ = 101021221118. Its totient is φ = 101021221116.
The previous prime is 101021221079. The next prime is 101021221123. The reversal of 101021221117 is 711122120101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99650074276 + 1371146841 = 315674^2 + 37029^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101021221117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101021221094 and 101021221103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101021221157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510610558 + 50510610559.
It is an arithmetic number, because the mean of its divisors is an integer number (50510610559).
Almost surely, 2101021221117 is an apocalyptic number.
It is an amenable number.
101021221117 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021221117 is an equidigital number, since it uses as much as digits as its factorization.
101021221117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 101021221117 its reverse (711122120101), we get a palindrome (812143341218).
The spelling of 101021221117 in words is "one hundred one billion, twenty-one million, two hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •