Base | Representation |
---|---|
bin | 110001000010111001… |
… | …1101100010000100101 |
3 | 101001212012221110001222 |
4 | 1202011303230100211 |
5 | 3211200434313321 |
6 | 120215113430125 |
7 | 10416013244216 |
oct | 1420563542045 |
9 | 331765843058 |
10 | 105324135461 |
11 | 40738801956 |
12 | 184b4a0b345 |
13 | 9c1686995c |
14 | 51521b940d |
15 | 2b1686b3ab |
hex | 1885cec425 |
105324135461 has 2 divisors, whose sum is σ = 105324135462. Its totient is φ = 105324135460.
The previous prime is 105324135419. The next prime is 105324135479. The reversal of 105324135461 is 164531423501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86618376100 + 18705759361 = 294310^2 + 136769^2 .
It is an emirp because it is prime and its reverse (164531423501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105324135461 - 210 = 105324134437 is a prime.
It is a super-2 number, since 2×1053241354612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105324131461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52662067730 + 52662067731.
It is an arithmetic number, because the mean of its divisors is an integer number (52662067731).
Almost surely, 2105324135461 is an apocalyptic number.
It is an amenable number.
105324135461 is a deficient number, since it is larger than the sum of its proper divisors (1).
105324135461 is an equidigital number, since it uses as much as digits as its factorization.
105324135461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 105324135461 its reverse (164531423501), we get a palindrome (269855558962).
The spelling of 105324135461 in words is "one hundred five billion, three hundred twenty-four million, one hundred thirty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •