Base | Representation |
---|---|
bin | 1100110010101… |
… | …1001000011011 |
3 | 10201221220111210 |
4 | 3030223020123 |
5 | 102213412133 |
6 | 5153554203 |
7 | 1221023532 |
oct | 314531033 |
9 | 121856453 |
10 | 53654043 |
11 | 28317093 |
12 | 15b75963 |
13 | b167671 |
14 | 71a9319 |
15 | 4a9c763 |
hex | 332b21b |
53654043 has 8 divisors (see below), whose sum is σ = 75304000. Its totient is φ = 33886728.
The previous prime is 53654017. The next prime is 53654053. The reversal of 53654043 is 34045635.
53654043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53654043 - 26 = 53653979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53654043.
It is not an unprimeable number, because it can be changed into a prime (53654053) 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, 470593 + ... + 470706.
It is an arithmetic number, because the mean of its divisors is an integer number (9413000).
Almost surely, 253654043 is an apocalyptic number.
53654043 is a deficient number, since it is larger than the sum of its proper divisors (21649957).
53654043 is a wasteful number, since it uses less digits than its factorization.
53654043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941321.
The product of its (nonzero) digits is 21600, while the sum is 30.
The square root of 53654043 is about 7324.8920128559. The cubic root of 53654043 is about 377.1674026192.
Adding to 53654043 its reverse (34045635), we get a palindrome (87699678).
The spelling of 53654043 in words is "fifty-three million, six hundred fifty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •