Base | Representation |
---|---|
bin | 1100110000000… |
… | …0001100110110 |
3 | 10201121222022000 |
4 | 3030000030312 |
5 | 102142300243 |
6 | 5150120130 |
7 | 1216362054 |
oct | 314001466 |
9 | 121558260 |
10 | 53478198 |
11 | 28206a64 |
12 | 15ab0046 |
13 | b105607 |
14 | 71611d4 |
15 | 4a655d3 |
hex | 3300336 |
53478198 has 64 divisors (see below), whose sum is σ = 127872000. Its totient is φ = 16513632.
The previous prime is 53478163. The next prime is 53478199. The reversal of 53478198 is 89187435.
It is a super-2 number, since 2×534781982 = 5719835322654408, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53478199) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47668 + ... + 48776.
It is an arithmetic number, because the mean of its divisors is an integer number (1998000).
Almost surely, 253478198 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53478198, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63936000).
53478198 is an abundant number, since it is smaller than the sum of its proper divisors (74393802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53478198 is a wasteful number, since it uses less digits than its factorization.
53478198 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1186 (or 1180 counting only the distinct ones).
The product of its digits is 241920, while the sum is 45.
The square root of 53478198 is about 7312.8789132598. The cubic root of 53478198 is about 376.7549106256.
It can be divided in two parts, 5 and 3478198, that added together give a triangular number (3478203 = T2637).
The spelling of 53478198 in words is "fifty-three million, four hundred seventy-eight thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •