Base | Representation |
---|---|
bin | 1100101001011… |
… | …0100010111001 |
3 | 10200210222122200 |
4 | 3022112202321 |
5 | 102034423213 |
6 | 5132540413 |
7 | 1212610260 |
oct | 312264271 |
9 | 120728580 |
10 | 53045433 |
11 | 27a40901 |
12 | 15921709 |
13 | acb363c |
14 | 708b5d7 |
15 | 49cc273 |
hex | 32968b9 |
53045433 has 48 divisors (see below), whose sum is σ = 91493376. Its totient is φ = 28978560.
The previous prime is 53045411. The next prime is 53045453. The reversal of 53045433 is 33454035.
It is a happy number.
53045433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53045433 - 25 = 53045401 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53045397 and 53045406.
It is not an unprimeable number, because it can be changed into a prime (53045453) 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 47 ways as a sum of consecutive naturals, for example, 306535 + ... + 306707.
It is an arithmetic number, because the mean of its divisors is an integer number (1906112).
Almost surely, 253045433 is an apocalyptic number.
It is an amenable number.
53045433 is a deficient number, since it is larger than the sum of its proper divisors (38447943).
53045433 is a wasteful number, since it uses less digits than its factorization.
53045433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374 (or 371 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 27.
The square root of 53045433 is about 7283.2295721060. The cubic root of 53045433 is about 375.7358776795.
Adding to 53045433 its reverse (33454035), we get a palindrome (86499468).
The spelling of 53045433 in words is "fifty-three million, forty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •