Base | Representation |
---|---|
bin | 10101100110111001… |
… | …111110011001111011 |
3 | 2012212221100200110001 |
4 | 111212321332121323 |
5 | 340004013412311 |
6 | 14354124333431 |
7 | 1450643612113 |
oct | 254671763173 |
9 | 65787320401 |
10 | 23201310331 |
11 | 9926597941 |
12 | 45b60a4277 |
13 | 22599b49c4 |
14 | 11a1532043 |
15 | 90bd274c1 |
hex | 566e7e67b |
23201310331 has 2 divisors, whose sum is σ = 23201310332. Its totient is φ = 23201310330.
The previous prime is 23201310281. The next prime is 23201310359. The reversal of 23201310331 is 13301310232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23201310331 - 225 = 23167755899 is a prime.
It is a super-2 number, since 2×232013103312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23201310299 and 23201310308.
It is not a weakly prime, because it can be changed into another prime (23201310631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11600655165 + 11600655166.
It is an arithmetic number, because the mean of its divisors is an integer number (11600655166).
Almost surely, 223201310331 is an apocalyptic number.
23201310331 is a deficient number, since it is larger than the sum of its proper divisors (1).
23201310331 is an equidigital number, since it uses as much as digits as its factorization.
23201310331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 23201310331 its reverse (13301310232), we get a palindrome (36502620563).
Subtracting from 23201310331 its reverse (13301310232), we obtain a palindrome (9900000099).
The spelling of 23201310331 in words is "twenty-three billion, two hundred one million, three hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •