Base | Representation |
---|---|
bin | 1010100100111111101000… |
… | …01101100000000000000001 |
3 | 10001100202121010121210111122 |
4 | 11102133310031200000001 |
5 | 11022103213320244424 |
6 | 121250040413522025 |
7 | 4620401546615405 |
oct | 522376415400001 |
9 | 101322533553448 |
10 | 23261345087489 |
11 | 7459098975123 |
12 | 27382554a3315 |
13 | cc96c6453332 |
14 | 5a5bd85c5105 |
15 | 2a51333eb45e |
hex | 1527f4360001 |
23261345087489 has 2 divisors, whose sum is σ = 23261345087490. Its totient is φ = 23261345087488.
The previous prime is 23261345087459. The next prime is 23261345087549. The reversal of 23261345087489 is 98478054316232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17472124121089 + 5789220966400 = 4179967^2 + 2406080^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23261345087489 is a prime.
It is not a weakly prime, because it can be changed into another prime (23261345087459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11630672543744 + 11630672543745.
It is an arithmetic number, because the mean of its divisors is an integer number (11630672543745).
It is a 1-persistent number, because it is pandigital, but 2⋅23261345087489 = 46522690174978 is not.
Almost surely, 223261345087489 is an apocalyptic number.
It is an amenable number.
23261345087489 is a deficient number, since it is larger than the sum of its proper divisors (1).
23261345087489 is an equidigital number, since it uses as much as digits as its factorization.
23261345087489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69672960, while the sum is 62.
The spelling of 23261345087489 in words is "twenty-three trillion, two hundred sixty-one billion, three hundred forty-five million, eighty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •