Base | Representation |
---|---|
bin | 1010101010110011101110… |
… | …11011101111110110110001 |
3 | 10002001212020110012121020111 |
4 | 11111121313123233312301 |
5 | 11033341330433231421 |
6 | 121521515411141321 |
7 | 4641003206160253 |
oct | 525316733576661 |
9 | 102055213177214 |
10 | 23461115133361 |
11 | 7525891954394 |
12 | 276ab07ba4841 |
13 | 10124b1c2b079 |
14 | 5b1749d27cd3 |
15 | 2aa42659aee1 |
hex | 1556776efdb1 |
23461115133361 has 2 divisors, whose sum is σ = 23461115133362. Its totient is φ = 23461115133360.
The previous prime is 23461115133271. The next prime is 23461115133367. The reversal of 23461115133361 is 16333151116432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22489589497761 + 971525635600 = 4742319^2 + 985660^2 .
It is a cyclic number.
It is not a de Polignac number, because 23461115133361 - 29 = 23461115132849 is a prime.
It is not a weakly prime, because it can be changed into another prime (23461115133367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11730557566680 + 11730557566681.
It is an arithmetic number, because the mean of its divisors is an integer number (11730557566681).
Almost surely, 223461115133361 is an apocalyptic number.
It is an amenable number.
23461115133361 is a deficient number, since it is larger than the sum of its proper divisors (1).
23461115133361 is an equidigital number, since it uses as much as digits as its factorization.
23461115133361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 116640, while the sum is 40.
Adding to 23461115133361 its reverse (16333151116432), we get a palindrome (39794266249793).
The spelling of 23461115133361 in words is "twenty-three trillion, four hundred sixty-one billion, one hundred fifteen million, one hundred thirty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •