Base | Representation |
---|---|
bin | 1101100100000101000… |
… | …1010110100111100111 |
3 | 211021110210110020201002 |
4 | 3121001101112213213 |
5 | 12304212431131434 |
6 | 255014402023515 |
7 | 22556351246516 |
oct | 3310121264747 |
9 | 737423406632 |
10 | 233023302119 |
11 | 8a908640923 |
12 | 391b3047b9b |
13 | 18c87b66c2a |
14 | b3c7c7a67d |
15 | 60dc6e657e |
hex | 36414569e7 |
233023302119 has 2 divisors, whose sum is σ = 233023302120. Its totient is φ = 233023302118.
The previous prime is 233023302101. The next prime is 233023302133. The reversal of 233023302119 is 911203320332.
233023302119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233023302119 is a prime.
It is a super-2 number, since 2×2330233021192 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 233023302091 and 233023302100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (233023302319) 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, 116511651059 + 116511651060.
It is an arithmetic number, because the mean of its divisors is an integer number (116511651060).
Almost surely, 2233023302119 is an apocalyptic number.
233023302119 is a deficient number, since it is larger than the sum of its proper divisors (1).
233023302119 is an equidigital number, since it uses as much as digits as its factorization.
233023302119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 233023302119 in words is "two hundred thirty-three billion, twenty-three million, three hundred two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •