Base | Representation |
---|---|
bin | 1101001010001… |
… | …1100011100000 |
3 | 10211212020111120 |
4 | 3102203203200 |
5 | 103112231442 |
6 | 5251012240 |
7 | 1240104624 |
oct | 322434340 |
9 | 124766446 |
10 | 55195872 |
11 | 2917a526 |
12 | 1659a080 |
13 | b5873a4 |
14 | 748b184 |
15 | 4ca44ec |
hex | 34a38e0 |
55195872 has 96 divisors (see below), whose sum is σ = 158505984. Its totient is φ = 16742400.
The previous prime is 55195871. The next prime is 55195879. The reversal of 55195872 is 27859155.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55195871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50047 + ... + 51137.
It is an arithmetic number, because the mean of its divisors is an integer number (1651104).
Almost surely, 255195872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55195872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79252992).
55195872 is an abundant number, since it is smaller than the sum of its proper divisors (103310112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55195872 is a wasteful number, since it uses less digits than its factorization.
55195872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152 (or 1144 counting only the distinct ones).
The product of its digits is 126000, while the sum is 42.
The square root of 55195872 is about 7429.3924381473. The cubic root of 55195872 is about 380.7461608557.
The spelling of 55195872 in words is "fifty-five million, one hundred ninety-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •