Base | Representation |
---|---|
bin | 1101101011100001111… |
… | …0000011001101111111 |
3 | 211110122011110111001112 |
4 | 3122320132003031333 |
5 | 12322311404303411 |
6 | 255545041032235 |
7 | 22660043360225 |
oct | 3327036031577 |
9 | 743564414045 |
10 | 235023119231 |
11 | 9074447303a |
12 | 3967092567b |
13 | 19216278c74 |
14 | b5376c8b15 |
15 | 61a806eb8b |
hex | 36b878337f |
235023119231 has 2 divisors, whose sum is σ = 235023119232. Its totient is φ = 235023119230.
The previous prime is 235023119203. The next prime is 235023119263. The reversal of 235023119231 is 132911320532.
It is an a-pointer prime, because the next prime (235023119263) can be obtained adding 235023119231 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 235023119231 - 222 = 235018924927 is a prime.
It is a super-2 number, since 2×2350231192312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (235023169231) 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, 117511559615 + 117511559616.
It is an arithmetic number, because the mean of its divisors is an integer number (117511559616).
Almost surely, 2235023119231 is an apocalyptic number.
235023119231 is a deficient number, since it is larger than the sum of its proper divisors (1).
235023119231 is an equidigital number, since it uses as much as digits as its factorization.
235023119231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 235023119231 its reverse (132911320532), we get a palindrome (367934439763).
The spelling of 235023119231 in words is "two hundred thirty-five billion, twenty-three million, one hundred nineteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •