Base | Representation |
---|---|
bin | 11011110100101… |
… | …10111011000101 |
3 | 121021012001102111 |
4 | 31322112323011 |
5 | 434222331203 |
6 | 35054341021 |
7 | 5532612313 |
oct | 1572267305 |
9 | 537161374 |
10 | 233402053 |
11 | 10a827465 |
12 | 661ba771 |
13 | 39480931 |
14 | 22dd90b3 |
15 | 1575626d |
hex | de96ec5 |
233402053 has 8 divisors (see below), whose sum is σ = 243149760. Its totient is φ = 223847520.
The previous prime is 233402033. The next prime is 233402083. The reversal of 233402053 is 350204332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 233402053 - 25 = 233402021 is a prime.
It is a super-2 number, since 2×2334020532 = 108953036689229618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233402033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45825 + ... + 50662.
It is an arithmetic number, because the mean of its divisors is an integer number (30393720).
Almost surely, 2233402053 is an apocalyptic number.
It is an amenable number.
233402053 is a deficient number, since it is larger than the sum of its proper divisors (9747707).
233402053 is an equidigital number, since it uses as much as digits as its factorization.
233402053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96587.
The product of its (nonzero) digits is 2160, while the sum is 22.
The square root of 233402053 is about 15277.5015300277. The cubic root of 233402053 is about 615.6986820104.
Adding to 233402053 its reverse (350204332), we get a palindrome (583606385).
The spelling of 233402053 in words is "two hundred thirty-three million, four hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •