Base | Representation |
---|---|
bin | 1101000111111… |
… | …0111101110111 |
3 | 10211120121221000 |
4 | 3101332331313 |
5 | 103042433012 |
6 | 5243454343 |
7 | 1235611662 |
oct | 321767567 |
9 | 124517830 |
10 | 55046007 |
11 | 29087975 |
12 | 165273b3 |
13 | b534103 |
14 | 744c6d9 |
15 | 4c74ddc |
hex | 347ef77 |
55046007 has 16 divisors (see below), whose sum is σ = 81665280. Its totient is φ = 36645336.
The previous prime is 55046003. The next prime is 55046011. The reversal of 55046007 is 70064055.
55046007 is a `hidden beast` number, since 5 + 50 + 4 + 600 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (55046003) and next prime (55046011).
It is not a de Polignac number, because 55046007 - 22 = 55046003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55046003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32188 + ... + 33854.
It is an arithmetic number, because the mean of its divisors is an integer number (5104080).
Almost surely, 255046007 is an apocalyptic number.
55046007 is a deficient number, since it is larger than the sum of its proper divisors (26619273).
55046007 is a wasteful number, since it uses less digits than its factorization.
55046007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2899 (or 2893 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 55046007 is about 7419.2996300190. The cubic root of 55046007 is about 380.4012543620.
It can be divided in two parts, 5504 and 6007, that added together give a palindrome (11511).
The spelling of 55046007 in words is "fifty-five million, forty-six thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •