Base | Representation |
---|---|
bin | 1001000111010111010110… |
… | …0011110011000011001001 |
3 | 1022111002212112122112220221 |
4 | 2101311311203303003021 |
5 | 2303200311020114402 |
6 | 33152034201350041 |
7 | 2053034515042366 |
oct | 221656543630311 |
9 | 38432775575827 |
10 | 10022131019977 |
11 | 32143a875897a |
12 | 115a433498321 |
13 | 57911019230b |
14 | 26910645746d |
15 | 125a72d02337 |
hex | 91d758f30c9 |
10022131019977 has 2 divisors, whose sum is σ = 10022131019978. Its totient is φ = 10022131019976.
The previous prime is 10022131019921. The next prime is 10022131020001. The reversal of 10022131019977 is 77991013122001.
10022131019977 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8437694562441 + 1584436457536 = 2904771^2 + 1258744^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022131019977 - 227 = 10021996802249 is a prime.
It is a super-2 number, since 2×100221310199772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10022131019177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011065509988 + 5011065509989.
It is an arithmetic number, because the mean of its divisors is an integer number (5011065509989).
Almost surely, 210022131019977 is an apocalyptic number.
It is an amenable number.
10022131019977 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022131019977 is an equidigital number, since it uses as much as digits as its factorization.
10022131019977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 47628, while the sum is 43.
The spelling of 10022131019977 in words is "ten trillion, twenty-two billion, one hundred thirty-one million, nineteen thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •