Base | Representation |
---|---|
bin | 1101010100011… |
… | …0111001010010 |
3 | 10220010020020220 |
4 | 3111012321102 |
5 | 103300134124 |
6 | 5313213510 |
7 | 1245562320 |
oct | 325067122 |
9 | 126106226 |
10 | 55864914 |
11 | 29597156 |
12 | 16861296 |
13 | b75ca81 |
14 | 75c2d10 |
15 | 4d87879 |
hex | 3546e52 |
55864914 has 64 divisors (see below), whose sum is σ = 133373952. Its totient is φ = 15264000.
The previous prime is 55864903. The next prime is 55864937. The reversal of 55864914 is 41946855.
55864914 = 1262 + 1272 + ... + 5532.
55864914 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
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 31 ways as a sum of consecutive naturals, for example, 139114 + ... + 139514.
It is an arithmetic number, because the mean of its divisors is an integer number (2083968).
Almost surely, 255864914 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55864914, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66686976).
55864914 is an abundant number, since it is smaller than the sum of its proper divisors (77509038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55864914 is a wasteful number, since it uses less digits than its factorization.
55864914 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551.
The product of its digits is 172800, while the sum is 42.
The square root of 55864914 is about 7474.2835108123. The cubic root of 55864914 is about 382.2783576449.
The spelling of 55864914 in words is "fifty-five million, eight hundred sixty-four thousand, nine hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •