Base | Representation |
---|---|
bin | 1100101010010… |
… | …0010110010100 |
3 | 10200220212012201 |
4 | 3022210112110 |
5 | 102043230342 |
6 | 5134054244 |
7 | 1213234150 |
oct | 312442624 |
9 | 120825181 |
10 | 53101972 |
11 | 27a7a330 |
12 | 1594a384 |
13 | b0032b1 |
14 | 70a4060 |
15 | 49dddb7 |
hex | 32a4594 |
53101972 has 48 divisors (see below), whose sum is σ = 118081152. Its totient is φ = 20292480.
The previous prime is 53101969. The next prime is 53101981. The reversal of 53101972 is 27910135.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 53101972.
It is a congruent number.
It is an unprimeable number.
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, 14698 + ... + 17950.
It is an arithmetic number, because the mean of its divisors is an integer number (2460024).
Almost surely, 253101972 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 53101972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59040576).
53101972 is an abundant number, since it is smaller than the sum of its proper divisors (64979180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53101972 is a wasteful number, since it uses less digits than its factorization.
53101972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3328 (or 3326 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 28.
The square root of 53101972 is about 7287.1099895638. The cubic root of 53101972 is about 375.8693242142.
The spelling of 53101972 in words is "fifty-three million, one hundred one thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •