Base | Representation |
---|---|
bin | 1101010100111… |
… | …1100100010001 |
3 | 10220012000222102 |
4 | 3111033210101 |
5 | 103302303213 |
6 | 5314050145 |
7 | 1246101011 |
oct | 325174421 |
9 | 126160872 |
10 | 55900433 |
11 | 29610906 |
12 | 16879955 |
13 | b772ca4 |
14 | 75d1c41 |
15 | 4d93158 |
hex | 354f911 |
55900433 has 2 divisors, whose sum is σ = 55900434. Its totient is φ = 55900432.
The previous prime is 55900423. The next prime is 55900457. The reversal of 55900433 is 33400955.
55900433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52301824 + 3598609 = 7232^2 + 1897^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55900433 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55900396 and 55900405.
It is not a weakly prime, because it can be changed into another prime (55900423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27950216 + 27950217.
It is an arithmetic number, because the mean of its divisors is an integer number (27950217).
Almost surely, 255900433 is an apocalyptic number.
It is an amenable number.
55900433 is a deficient number, since it is larger than the sum of its proper divisors (1).
55900433 is an equidigital number, since it uses as much as digits as its factorization.
55900433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 55900433 is about 7476.6592138468. The cubic root of 55900433 is about 382.3593582072.
The spelling of 55900433 in words is "fifty-five million, nine hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •