Base | Representation |
---|---|
bin | 110100110011010010110011… |
… | …011011111010101011011111 |
3 | 1010110020022221012122202121121 |
4 | 310303102303123322223133 |
5 | 220414221310330400111 |
6 | 2141521525014511411 |
7 | 66625402624630252 |
oct | 6463226333725337 |
9 | 1113208835582547 |
10 | 232223302200031 |
11 | 67aa239305213a |
12 | 22066522065567 |
13 | 9c76742b2baac |
14 | 414b94c617099 |
15 | 1bca9dadc0871 |
hex | d334b36faadf |
232223302200031 has 2 divisors, whose sum is σ = 232223302200032. Its totient is φ = 232223302200030.
The previous prime is 232223302200023. The next prime is 232223302200067. The reversal of 232223302200031 is 130002203322232.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232223302200031 - 23 = 232223302200023 is a prime.
It is a super-2 number, since 2×2322233022000312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232223302199969 and 232223302200005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232223302200431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116111651100015 + 116111651100016.
It is an arithmetic number, because the mean of its divisors is an integer number (116111651100016).
Almost surely, 2232223302200031 is an apocalyptic number.
232223302200031 is a deficient number, since it is larger than the sum of its proper divisors (1).
232223302200031 is an equidigital number, since it uses as much as digits as its factorization.
232223302200031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 232223302200031 its reverse (130002203322232), we get a palindrome (362225505522263).
The spelling of 232223302200031 in words is "two hundred thirty-two trillion, two hundred twenty-three billion, three hundred two million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •