Base | Representation |
---|---|
bin | 1010100110110010111001… |
… | …10110000101111011110001 |
3 | 10001120200100000012012222201 |
4 | 11103121130312011323301 |
5 | 11024111433401214413 |
6 | 121334313300303201 |
7 | 4625022245555116 |
oct | 523313466057361 |
9 | 101520300165881 |
10 | 23323230101233 |
11 | 74823653a1987 |
12 | 27482466a1b01 |
13 | 10024a9597a6a |
14 | 5a8bc956090d |
15 | 2a6a5639b9dd |
hex | 15365cd85ef1 |
23323230101233 has 2 divisors, whose sum is σ = 23323230101234. Its totient is φ = 23323230101232.
The previous prime is 23323230101179. The next prime is 23323230101251. The reversal of 23323230101233 is 33210103232332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22361010360049 + 962219741184 = 4728743^2 + 980928^2 .
It is a cyclic number.
It is not a de Polignac number, because 23323230101233 - 221 = 23323228004081 is a prime.
It is a super-2 number, since 2×233232301012332 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23323230101293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11661615050616 + 11661615050617.
It is an arithmetic number, because the mean of its divisors is an integer number (11661615050617).
Almost surely, 223323230101233 is an apocalyptic number.
It is an amenable number.
23323230101233 is a deficient number, since it is larger than the sum of its proper divisors (1).
23323230101233 is an equidigital number, since it uses as much as digits as its factorization.
23323230101233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 23323230101233 its reverse (33210103232332), we get a palindrome (56533333333565).
The spelling of 23323230101233 in words is "twenty-three trillion, three hundred twenty-three billion, two hundred thirty million, one hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •