Base | Representation |
---|---|
bin | 110001000000001000… |
… | …0111010100111000001 |
3 | 101001121201221102211212 |
4 | 1202000100322213001 |
5 | 3211003132224441 |
6 | 120201552215505 |
7 | 10413503605322 |
oct | 1420020724701 |
9 | 331551842755 |
10 | 105231133121 |
11 | 406a025a914 |
12 | 1848983a595 |
13 | 9c0050629a |
14 | 5143aca449 |
15 | 2b0d5e9eeb |
hex | 188043a9c1 |
105231133121 has 2 divisors, whose sum is σ = 105231133122. Its totient is φ = 105231133120.
The previous prime is 105231133097. The next prime is 105231133153. The reversal of 105231133121 is 121331132501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102855545521 + 2375587600 = 320711^2 + 48740^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105231133121 is a prime.
It is a super-2 number, since 2×1052311331212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105231133181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52615566560 + 52615566561.
It is an arithmetic number, because the mean of its divisors is an integer number (52615566561).
Almost surely, 2105231133121 is an apocalyptic number.
It is an amenable number.
105231133121 is a deficient number, since it is larger than the sum of its proper divisors (1).
105231133121 is an equidigital number, since it uses as much as digits as its factorization.
105231133121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 105231133121 its reverse (121331132501), we get a palindrome (226562265622).
The spelling of 105231133121 in words is "one hundred five billion, two hundred thirty-one million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •