Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …101110110100101000010101 |
3 | 111020121111200100222021212002 |
4 | 112331233211232310220111 |
5 | 101214241010104101401 |
6 | 554450433020205045 |
7 | 30163003256604314 |
oct | 2675574556645025 |
9 | 436544610867762 |
10 | 101000010222101 |
11 | 2a1aa955784091 |
12 | b3b258b099785 |
13 | 444834c580463 |
14 | 1ad25d875a27b |
15 | ba2396da4a6b |
hex | 5bdbe5bb4a15 |
101000010222101 has 2 divisors, whose sum is σ = 101000010222102. Its totient is φ = 101000010222100.
The previous prime is 101000010221933. The next prime is 101000010222103. The reversal of 101000010222101 is 101222010000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98463428419876 + 2536581802225 = 9922874^2 + 1592665^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101000010222101 is a prime.
Together with 101000010222103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000010222103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500005111050 + 50500005111051.
It is an arithmetic number, because the mean of its divisors is an integer number (50500005111051).
Almost surely, 2101000010222101 is an apocalyptic number.
It is an amenable number.
101000010222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000010222101 is an equidigital number, since it uses as much as digits as its factorization.
101000010222101 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 11.
Adding to 101000010222101 its reverse (101222010000101), we get a palindrome (202222020222202).
The spelling of 101000010222101 in words is "one hundred one trillion, ten million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.616 sec. • engine limits •