Base | Representation |
---|---|
bin | 1010100110010001000001… |
… | …10110001011011010100001 |
3 | 10001111221101120010022220122 |
4 | 11103020200312023122201 |
5 | 11023312212131342122 |
6 | 121322104513050025 |
7 | 4623506464206326 |
oct | 523104066133241 |
9 | 101457346108818 |
10 | 23305043621537 |
11 | 7475682621577 |
12 | 274480bb56915 |
13 | 100086b835182 |
14 | 5a7d82070b4d |
15 | 2a633e95a142 |
hex | 153220d8b6a1 |
23305043621537 has 2 divisors, whose sum is σ = 23305043621538. Its totient is φ = 23305043621536.
The previous prime is 23305043621527. The next prime is 23305043621557. The reversal of 23305043621537 is 73512634050332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23106854827681 + 198188793856 = 4806959^2 + 445184^2 .
It is a cyclic number.
It is not a de Polignac number, because 23305043621537 - 224 = 23305026844321 is a prime.
It is not a weakly prime, because it can be changed into another prime (23305043621527) 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, 11652521810768 + 11652521810769.
It is an arithmetic number, because the mean of its divisors is an integer number (11652521810769).
Almost surely, 223305043621537 is an apocalyptic number.
It is an amenable number.
23305043621537 is a deficient number, since it is larger than the sum of its proper divisors (1).
23305043621537 is an equidigital number, since it uses as much as digits as its factorization.
23305043621537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 44.
Adding to 23305043621537 its reverse (73512634050332), we get a palindrome (96817677671869).
The spelling of 23305043621537 in words is "twenty-three trillion, three hundred five billion, forty-three million, six hundred twenty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •