Base | Representation |
---|---|
bin | 1101001011101… |
… | …0100101111001 |
3 | 10212001000221102 |
4 | 3102322211321 |
5 | 103123241413 |
6 | 5253021145 |
7 | 1240650005 |
oct | 322724571 |
9 | 125030842 |
10 | 55290233 |
11 | 29234409 |
12 | 166247b5 |
13 | b5bb31b |
14 | 74b3705 |
15 | 4cc2458 |
hex | 34ba979 |
55290233 has 4 divisors (see below), whose sum is σ = 55494528. Its totient is φ = 55085940.
The previous prime is 55290223. The next prime is 55290241. The reversal of 55290233 is 33209255.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33209255 = 5 ⋅6641851.
It is a cyclic number.
It is not a de Polignac number, because 55290233 - 28 = 55289977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55290196 and 55290205.
It is not an unprimeable number, because it can be changed into a prime (55290223) 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, 101741 + ... + 102282.
It is an arithmetic number, because the mean of its divisors is an integer number (13873632).
Almost surely, 255290233 is an apocalyptic number.
It is an amenable number.
55290233 is a deficient number, since it is larger than the sum of its proper divisors (204295).
55290233 is a wasteful number, since it uses less digits than its factorization.
55290233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204294.
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 55290233 is about 7435.7402455976. The cubic root of 55290233 is about 380.9630075937.
Adding to 55290233 its reverse (33209255), we get a palindrome (88499488).
The spelling of 55290233 in words is "fifty-five million, two hundred ninety thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •