Base | Representation |
---|---|
bin | 10110111111100001001110… |
… | …000110001001010111011101 |
3 | 111021001011121110100221210001 |
4 | 112333201032012021113131 |
5 | 101223240344141013401 |
6 | 555022451554414301 |
7 | 30204552634001503 |
oct | 2677411606112735 |
9 | 437034543327701 |
10 | 101122020251101 |
11 | 2a2476762057a3 |
12 | b41215bb91391 |
13 | 44569c50139a5 |
14 | 1ad8490a0c673 |
15 | ba563854e601 |
hex | 5bf84e1895dd |
101122020251101 has 2 divisors, whose sum is σ = 101122020251102. Its totient is φ = 101122020251100.
The previous prime is 101122020251099. The next prime is 101122020251113. The reversal of 101122020251101 is 101152020221101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94593617105625 + 6528403145476 = 9725925^2 + 2555074^2 .
It is a cyclic number.
It is not a de Polignac number, because 101122020251101 - 21 = 101122020251099 is a prime.
Together with 101122020251099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101122026251101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561010125550 + 50561010125551.
It is an arithmetic number, because the mean of its divisors is an integer number (50561010125551).
Almost surely, 2101122020251101 is an apocalyptic number.
It is an amenable number.
101122020251101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101122020251101 is an equidigital number, since it uses as much as digits as its factorization.
101122020251101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 101122020251101 its reverse (101152020221101), we get a palindrome (202274040472202).
The spelling of 101122020251101 in words is "one hundred one trillion, one hundred twenty-two billion, twenty million, two hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •