Base | Representation |
---|---|
bin | 1101100101100111010… |
… | …1100010110001000001 |
3 | 211022112111222010200001 |
4 | 3121121311202301001 |
5 | 12311033433122431 |
6 | 255123323400001 |
7 | 22602514343311 |
oct | 3313165426101 |
9 | 738474863601 |
10 | 233435442241 |
11 | 8aaaa2488a1 |
12 | 392a9083001 |
13 | 19022369221 |
14 | b4268c1441 |
15 | 61139a6e61 |
hex | 3659d62c41 |
233435442241 has 4 divisors (see below), whose sum is σ = 233647080192. Its totient is φ = 233223804292.
The previous prime is 233435442209. The next prime is 233435442257. The reversal of 233435442241 is 142244534332.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 233435442241 - 25 = 233435442209 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 233435442241.
It is not an unprimeable number, because it can be changed into a prime (233435442941) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105817321 + ... + 105819526.
It is an arithmetic number, because the mean of its divisors is an integer number (58411770048).
Almost surely, 2233435442241 is an apocalyptic number.
It is an amenable number.
233435442241 is a deficient number, since it is larger than the sum of its proper divisors (211637951).
233435442241 is a wasteful number, since it uses less digits than its factorization.
233435442241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211637950.
The product of its digits is 276480, while the sum is 37.
Adding to 233435442241 its reverse (142244534332), we get a palindrome (375679976573).
The spelling of 233435442241 in words is "two hundred thirty-three billion, four hundred thirty-five million, four hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •