Base | Representation |
---|---|
bin | 1010100100011000010010… |
… | …00100111000011100010001 |
3 | 10001021202001220122002012212 |
4 | 11102030021010320130101 |
5 | 11021231432400011421 |
6 | 121232224304401505 |
7 | 4616023216163552 |
oct | 522141104703421 |
9 | 101252056562185 |
10 | 23240220313361 |
11 | 745013854a707 |
12 | 273413a916295 |
13 | cc770aa3259c |
14 | 5a4b92b92329 |
15 | 2a47e8a53e5b |
hex | 152309138711 |
23240220313361 has 2 divisors, whose sum is σ = 23240220313362. Its totient is φ = 23240220313360.
The previous prime is 23240220313309. The next prime is 23240220313423. The reversal of 23240220313361 is 16331302204232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12542087673361 + 10698132640000 = 3541481^2 + 3270800^2 .
It is a cyclic number.
It is not a de Polignac number, because 23240220313361 - 226 = 23240153204497 is a prime.
It is not a weakly prime, because it can be changed into another prime (23240220313561) 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, 11620110156680 + 11620110156681.
It is an arithmetic number, because the mean of its divisors is an integer number (11620110156681).
Almost surely, 223240220313361 is an apocalyptic number.
It is an amenable number.
23240220313361 is a deficient number, since it is larger than the sum of its proper divisors (1).
23240220313361 is an equidigital number, since it uses as much as digits as its factorization.
23240220313361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 23240220313361 its reverse (16331302204232), we get a palindrome (39571522517593).
The spelling of 23240220313361 in words is "twenty-three trillion, two hundred forty billion, two hundred twenty million, three hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •