Base | Representation |
---|---|
bin | 1101100100111000110… |
… | …0100001110110110010 |
3 | 211022000220110211001102 |
4 | 3121032030201312302 |
5 | 12310133434004414 |
6 | 255052105404402 |
7 | 22564623326522 |
oct | 3311614416662 |
9 | 738026424042 |
10 | 233240141234 |
11 | 8aa09a85301 |
12 | 39253799702 |
13 | 18cc0a689b9 |
14 | b4089a3682 |
15 | 6101779ede |
hex | 364e321db2 |
233240141234 has 4 divisors (see below), whose sum is σ = 349860211854. Its totient is φ = 116620070616.
The previous prime is 233240141231. The next prime is 233240141269. The reversal of 233240141234 is 432141042332.
233240141234 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 179603897209 + 53636244025 = 423797^2 + 231595^2 .
It is a junction number, because it is equal to n+sod(n) for n = 233240141197 and 233240141206.
It is not an unprimeable number, because it can be changed into a prime (233240141231) 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, 58310035307 + ... + 58310035310.
Almost surely, 2233240141234 is an apocalyptic number.
233240141234 is a deficient number, since it is larger than the sum of its proper divisors (116620070620).
233240141234 is a wasteful number, since it uses less digits than its factorization.
233240141234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116620070619.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 233240141234 its reverse (432141042332), we get a palindrome (665381183566).
The spelling of 233240141234 in words is "two hundred thirty-three billion, two hundred forty million, one hundred forty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •