Base | Representation |
---|---|
bin | 1100101100001… |
… | …0110011001101 |
3 | 10201011012022022 |
4 | 3023002303031 |
5 | 102111223301 |
6 | 5140455525 |
7 | 1214263613 |
oct | 313026315 |
9 | 121135268 |
10 | 53226701 |
11 | 28055010 |
12 | 159aa5a5 |
13 | b047cb8 |
14 | 70d76b3 |
15 | 4a15d1b |
hex | 32c2ccd |
53226701 has 8 divisors (see below), whose sum is σ = 59301504. Its totient is φ = 47357920.
The previous prime is 53226689. The next prime is 53226703. The reversal of 53226701 is 10762235.
53226701 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53226701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53226703) 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, 50960 + ... + 51993.
It is an arithmetic number, because the mean of its divisors is an integer number (7412688).
Almost surely, 253226701 is an apocalyptic number.
It is an amenable number.
53226701 is a deficient number, since it is larger than the sum of its proper divisors (6074803).
53226701 is a wasteful number, since it uses less digits than its factorization.
53226701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103011.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 53226701 is about 7295.6631638255. The cubic root of 53226701 is about 376.1633820101.
Adding to 53226701 its reverse (10762235), we get a palindrome (63988936).
The spelling of 53226701 in words is "fifty-three million, two hundred twenty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •