Base | Representation |
---|---|
bin | 110000111100111011… |
… | …0000110100111100001 |
3 | 101001100020022010012021 |
4 | 1201321312012213201 |
5 | 3210243100103441 |
6 | 120143144101441 |
7 | 10411025335426 |
oct | 1417166064741 |
9 | 331306263167 |
10 | 105123441121 |
11 | 40645495266 |
12 | 18459764881 |
13 | 9bb40cb5ca |
14 | 5133695d4d |
15 | 2b03e263d1 |
hex | 1879d869e1 |
105123441121 has 2 divisors, whose sum is σ = 105123441122. Its totient is φ = 105123441120.
The previous prime is 105123441113. The next prime is 105123441173. The reversal of 105123441121 is 121144321501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104740260496 + 383180625 = 323636^2 + 19575^2 .
It is a cyclic number.
It is not a de Polignac number, because 105123441121 - 23 = 105123441113 is a prime.
It is a super-2 number, since 2×1051234411212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105123481121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52561720560 + 52561720561.
It is an arithmetic number, because the mean of its divisors is an integer number (52561720561).
Almost surely, 2105123441121 is an apocalyptic number.
It is an amenable number.
105123441121 is a deficient number, since it is larger than the sum of its proper divisors (1).
105123441121 is an equidigital number, since it uses as much as digits as its factorization.
105123441121 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 25.
Adding to 105123441121 its reverse (121144321501), we get a palindrome (226267762622).
The spelling of 105123441121 in words is "one hundred five billion, one hundred twenty-three million, four hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •