Base | Representation |
---|---|
bin | 1100101010111… |
… | …1000001110001 |
3 | 10201000002012202 |
4 | 3022233001301 |
5 | 102101130323 |
6 | 5135032545 |
7 | 1213505525 |
oct | 312570161 |
9 | 121002182 |
10 | 53145713 |
11 | 27aaa185 |
12 | 1596b755 |
13 | b01a18a |
14 | 70b5d85 |
15 | 49ebd28 |
hex | 32af071 |
53145713 has 4 divisors (see below), whose sum is σ = 53368320. Its totient is φ = 52923108.
The previous prime is 53145707. The next prime is 53145731. The reversal of 53145713 is 31754135.
53145713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 53145713 - 26 = 53145649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53145613) 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 3 ways as a sum of consecutive naturals, for example, 110945 + ... + 111422.
It is an arithmetic number, because the mean of its divisors is an integer number (13342080).
Almost surely, 253145713 is an apocalyptic number.
It is an amenable number.
53145713 is a deficient number, since it is larger than the sum of its proper divisors (222607).
53145713 is a wasteful number, since it uses less digits than its factorization.
53145713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222606.
The product of its digits is 6300, while the sum is 29.
The square root of 53145713 is about 7290.1106301619. The cubic root of 53145713 is about 375.9724992147.
Adding to 53145713 its reverse (31754135), we get a palindrome (84899848).
The spelling of 53145713 in words is "fifty-three million, one hundred forty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •