Base | Representation |
---|---|
bin | 1010101001101001110001… |
… | …11010011111101110111001 |
3 | 10001221001202102212020121001 |
4 | 11110310320322133232321 |
5 | 11032214022322223023 |
6 | 121451351541045001 |
7 | 4635066261102553 |
oct | 524647072375671 |
9 | 101831672766531 |
10 | 23421411523513 |
11 | 750aa68234693 |
12 | 27632873b6761 |
13 | 100b8253b14c3 |
14 | 5ad860c704d3 |
15 | 2a93a0b0d6ad |
hex | 154d38e9fbb9 |
23421411523513 has 2 divisors, whose sum is σ = 23421411523514. Its totient is φ = 23421411523512.
The previous prime is 23421411523501. The next prime is 23421411523561. The reversal of 23421411523513 is 31532511412432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21819334027689 + 1602077495824 = 4671117^2 + 1265732^2 .
It is a cyclic number.
It is not a de Polignac number, because 23421411523513 - 25 = 23421411523481 is a prime.
It is a super-2 number, since 2×234214115235132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23421411523813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11710705761756 + 11710705761757.
It is an arithmetic number, because the mean of its divisors is an integer number (11710705761757).
Almost surely, 223421411523513 is an apocalyptic number.
It is an amenable number.
23421411523513 is a deficient number, since it is larger than the sum of its proper divisors (1).
23421411523513 is an equidigital number, since it uses as much as digits as its factorization.
23421411523513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 37.
Adding to 23421411523513 its reverse (31532511412432), we get a palindrome (54953922935945).
The spelling of 23421411523513 in words is "twenty-three trillion, four hundred twenty-one billion, four hundred eleven million, five hundred twenty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •