Base | Representation |
---|---|
bin | 110000111100100011… |
… | …1100001101111111001 |
3 | 101001022101022210201101 |
4 | 1201321013201233321 |
5 | 3210231433401411 |
6 | 120142030251401 |
7 | 10410516504004 |
oct | 1417107415771 |
9 | 331271283641 |
10 | 105111231481 |
11 | 40639605a53 |
12 | 18455656b61 |
13 | 9bb1715079 |
14 | 5131bd853b |
15 | 2b02d138c1 |
hex | 18791e1bf9 |
105111231481 has 2 divisors, whose sum is σ = 105111231482. Its totient is φ = 105111231480.
The previous prime is 105111231403. The next prime is 105111231509. The reversal of 105111231481 is 184132111501.
It is an a-pointer prime, because the next prime (105111231509) can be obtained adding 105111231481 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75043671481 + 30067560000 = 273941^2 + 173400^2 .
It is a cyclic number.
It is not a de Polignac number, because 105111231481 - 221 = 105109134329 is a prime.
It is a super-2 number, since 2×1051112314812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105111211481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52555615740 + 52555615741.
It is an arithmetic number, because the mean of its divisors is an integer number (52555615741).
Almost surely, 2105111231481 is an apocalyptic number.
It is an amenable number.
105111231481 is a deficient number, since it is larger than the sum of its proper divisors (1).
105111231481 is an equidigital number, since it uses as much as digits as its factorization.
105111231481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 28.
Adding to 105111231481 its reverse (184132111501), we get a palindrome (289243342982).
The spelling of 105111231481 in words is "one hundred five billion, one hundred eleven million, two hundred thirty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •