Base | Representation |
---|---|
bin | 1100101100010… |
… | …1001010101110 |
3 | 10201011200121110 |
4 | 3023011022232 |
5 | 102112031043 |
6 | 5141012450 |
7 | 1214334105 |
oct | 313051256 |
9 | 121150543 |
10 | 53236398 |
11 | 28061326 |
12 | 159b4126 |
13 | b04c537 |
14 | 70db03c |
15 | 4a18b33 |
hex | 32c52ae |
53236398 has 16 divisors (see below), whose sum is σ = 111102336. Its totient is φ = 16973880.
The previous prime is 53236397. The next prime is 53236399. The reversal of 53236398 is 89363235.
53236398 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (53236397) and next prime (53236399).
It is a super-2 number, since 2×532363982 = 5668228144028808, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53236397) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 192748 + ... + 193023.
It is an arithmetic number, because the mean of its divisors is an integer number (6943896).
Almost surely, 253236398 is an apocalyptic number.
53236398 is an abundant number, since it is smaller than the sum of its proper divisors (57865938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53236398 is a wasteful number, since it uses less digits than its factorization.
53236398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385799.
The product of its digits is 116640, while the sum is 39.
The square root of 53236398 is about 7296.3277064562. The cubic root of 53236398 is about 376.1862241473.
The spelling of 53236398 in words is "fifty-three million, two hundred thirty-six thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •