Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1110000110111001101 |
3 | 110112102021222210211112 |
4 | 1322012301300313031 |
5 | 4122003203223041 |
6 | 140121534501405 |
7 | 12321014256116 |
oct | 1720661606715 |
9 | 415367883745 |
10 | 131110211021 |
11 | 506703290a9 |
12 | 214b0664865 |
13 | c495bbc12a |
14 | 64bab0520d |
15 | 3625564deb |
hex | 1e86c70dcd |
131110211021 has 2 divisors, whose sum is σ = 131110211022. Its totient is φ = 131110211020.
The previous prime is 131110211017. The next prime is 131110211033. The reversal of 131110211021 is 120112011131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118366962025 + 12743248996 = 344045^2 + 112886^2 .
It is a cyclic number.
It is not a de Polignac number, because 131110211021 - 22 = 131110211017 is a prime.
It is a super-2 number, since 2×1311102110212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131110210987 and 131110211005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131110211521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65555105510 + 65555105511.
It is an arithmetic number, because the mean of its divisors is an integer number (65555105511).
Almost surely, 2131110211021 is an apocalyptic number.
It is an amenable number.
131110211021 is a deficient number, since it is larger than the sum of its proper divisors (1).
131110211021 is an equidigital number, since it uses as much as digits as its factorization.
131110211021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 131110211021 its reverse (120112011131), we get a palindrome (251222222152).
The spelling of 131110211021 in words is "one hundred thirty-one billion, one hundred ten million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •