Base | Representation |
---|---|
bin | 1101001101010… |
… | …1101011111110 |
3 | 10212020200011211 |
4 | 3103111223332 |
5 | 103140314324 |
6 | 5255235034 |
7 | 1241621401 |
oct | 323255376 |
9 | 125220154 |
10 | 55401214 |
11 | 292aa830 |
12 | 16678a7a |
13 | b6299ab |
14 | 7501d38 |
15 | 4ce5294 |
hex | 34d5afe |
55401214 has 8 divisors (see below), whose sum is σ = 90656568. Its totient is φ = 25182360.
The previous prime is 55401211. The next prime is 55401217. The reversal of 55401214 is 41210455.
It is an interprime number because it is at equal distance from previous prime (55401211) and next prime (55401217).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 2518237 = 55401214 / (5 + 5 + 4 + 0 + 1 + 2 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55401211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1259097 + ... + 1259140.
It is an arithmetic number, because the mean of its divisors is an integer number (11332071).
Almost surely, 255401214 is an apocalyptic number.
55401214 is a deficient number, since it is larger than the sum of its proper divisors (35255354).
55401214 is a wasteful number, since it uses less digits than its factorization.
55401214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2518250.
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 55401214 is about 7443.1991777730. The cubic root of 55401214 is about 381.2177325015.
Adding to 55401214 its reverse (41210455), we get a palindrome (96611669).
The spelling of 55401214 in words is "fifty-five million, four hundred one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •