Base | Representation |
---|---|
bin | 10110111111001110110001… |
… | …010100110110100011101001 |
3 | 111020222021110212021210210201 |
4 | 112333032301110312203221 |
5 | 101222424311303322441 |
6 | 555005414132512201 |
7 | 30203252006316604 |
oct | 2677166124664351 |
9 | 436867425253721 |
10 | 101102210214121 |
11 | 2a23a22aa33806 |
12 | b40a35177b661 |
13 | 4454b88abaa0c |
14 | 1ad7531a5533b |
15 | ba4d79308c31 |
hex | 5bf3b15368e9 |
101102210214121 has 2 divisors, whose sum is σ = 101102210214122. Its totient is φ = 101102210214120.
The previous prime is 101102210214067. The next prime is 101102210214133. The reversal of 101102210214121 is 121412012201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95818354029225 + 5283856184896 = 9788685^2 + 2298664^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102210214121 - 27 = 101102210213993 is a prime.
It is not a weakly prime, because it can be changed into another prime (101102210214221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551105107060 + 50551105107061.
It is an arithmetic number, because the mean of its divisors is an integer number (50551105107061).
Almost surely, 2101102210214121 is an apocalyptic number.
It is an amenable number.
101102210214121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102210214121 is an equidigital number, since it uses as much as digits as its factorization.
101102210214121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 101102210214121 its reverse (121412012201101), we get a palindrome (222514222415222).
The spelling of 101102210214121 in words is "one hundred one trillion, one hundred two billion, two hundred ten million, two hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •