Base | Representation |
---|---|
bin | 1100101100000… |
… | …1000101110001 |
3 | 10201010211200220 |
4 | 3023001011301 |
5 | 102111012242 |
6 | 5140403253 |
7 | 1214234316 |
oct | 313010561 |
9 | 121124626 |
10 | 53219697 |
11 | 2804a823 |
12 | 159a6529 |
13 | b044a5b |
14 | 70d4d0d |
15 | 4a13bec |
hex | 32c1171 |
53219697 has 4 divisors (see below), whose sum is σ = 70959600. Its totient is φ = 35479796.
The previous prime is 53219689. The next prime is 53219759. The reversal of 53219697 is 79691235.
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 53219697 - 23 = 53219689 is a prime.
It is a super-2 number, since 2×532196972 = 5664672297543618, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (53219687) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 8869947 + ... + 8869952.
It is an arithmetic number, because the mean of its divisors is an integer number (17739900).
Almost surely, 253219697 is an apocalyptic number.
It is an amenable number.
53219697 is a deficient number, since it is larger than the sum of its proper divisors (17739903).
53219697 is a wasteful number, since it uses less digits than its factorization.
53219697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17739902.
The product of its digits is 102060, while the sum is 42.
The square root of 53219697 is about 7295.1831368376. The cubic root of 53219697 is about 376.1468817458.
The spelling of 53219697 in words is "fifty-three million, two hundred nineteen thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •