Base | Representation |
---|---|
bin | 1101001000010… |
… | …1111100101001 |
3 | 10211122002011001 |
4 | 3102011330221 |
5 | 103044341401 |
6 | 5244235001 |
7 | 1236061231 |
oct | 322057451 |
9 | 124562131 |
10 | 55074601 |
11 | 290a73aa |
12 | 1653ba61 |
13 | b54412a |
14 | 7458cc1 |
15 | 4c7d601 |
hex | 3485f29 |
55074601 has 2 divisors, whose sum is σ = 55074602. Its totient is φ = 55074600.
The previous prime is 55074599. The next prime is 55074623. The reversal of 55074601 is 10647055.
55074601 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., 45158400 + 9916201 = 6720^2 + 3149^2 .
It is a cyclic number.
It is not a de Polignac number, because 55074601 - 21 = 55074599 is a prime.
Together with 55074599, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 55074601.
It is not a weakly prime, because it can be changed into another prime (55074641) 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, 27537300 + 27537301.
It is an arithmetic number, because the mean of its divisors is an integer number (27537301).
Almost surely, 255074601 is an apocalyptic number.
It is an amenable number.
55074601 is a deficient number, since it is larger than the sum of its proper divisors (1).
55074601 is an equidigital number, since it uses as much as digits as its factorization.
55074601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 55074601 is about 7421.2263811314. The cubic root of 55074601 is about 380.4671102475.
The spelling of 55074601 in words is "fifty-five million, seventy-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •