Base | Representation |
---|---|
bin | 1101001011111… |
… | …0011000010001 |
3 | 10212001211012221 |
4 | 3102332120101 |
5 | 103124240440 |
6 | 5253221041 |
7 | 1241043145 |
oct | 322763021 |
9 | 125054187 |
10 | 55305745 |
11 | 29245030 |
12 | 16631781 |
13 | b5c53c1 |
14 | 74b9225 |
15 | 4cc6d4a |
hex | 34be611 |
55305745 has 16 divisors (see below), whose sum is σ = 72627840. Its totient is φ = 40096000.
The previous prime is 55305727. The next prime is 55305763. The reversal of 55305745 is 54750355.
55305745 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (55305727) and next prime (55305763).
It is not a de Polignac number, because 55305745 - 215 = 55272977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55305745.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 18345 + ... + 21145.
It is an arithmetic number, because the mean of its divisors is an integer number (4539240).
Almost surely, 255305745 is an apocalyptic number.
55305745 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
55305745 is a deficient number, since it is larger than the sum of its proper divisors (17322095).
55305745 is a wasteful number, since it uses less digits than its factorization.
55305745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3176.
The product of its (nonzero) digits is 52500, while the sum is 34.
The square root of 55305745 is about 7436.7832427737. The cubic root of 55305745 is about 380.9986313998.
The spelling of 55305745 in words is "fifty-five million, three hundred five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •