Base | Representation |
---|---|
bin | 1101001100001… |
… | …0100110010111 |
3 | 10212002200221011 |
4 | 3103002212113 |
5 | 103130314111 |
6 | 5253433051 |
7 | 1241144431 |
oct | 323024627 |
9 | 125080834 |
10 | 55323031 |
11 | 29257015 |
12 | 1663b787 |
13 | b60022a |
14 | 74c1651 |
15 | 4ccc021 |
hex | 34c2997 |
55323031 has 2 divisors, whose sum is σ = 55323032. Its totient is φ = 55323030.
The previous prime is 55323019. The next prime is 55323067. The reversal of 55323031 is 13032355.
It is a happy number.
55323031 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 is a cyclic number.
It is not a de Polignac number, because 55323031 - 211 = 55320983 is a prime.
It is a super-2 number, since 2×553230312 = 6121275518053922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55322993 and 55323011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55323001) 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, 27661515 + 27661516.
It is an arithmetic number, because the mean of its divisors is an integer number (27661516).
Almost surely, 255323031 is an apocalyptic number.
55323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
55323031 is an equidigital number, since it uses as much as digits as its factorization.
55323031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 22.
The square root of 55323031 is about 7437.9453480111. The cubic root of 55323031 is about 381.0383214073.
Adding to 55323031 its reverse (13032355), we get a palindrome (68355386).
The spelling of 55323031 in words is "fifty-five million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •