Base | Representation |
---|---|
bin | 1100110100011… |
… | …0101100110001 |
3 | 10202011122101221 |
4 | 3031012230301 |
5 | 102231020321 |
6 | 5200225041 |
7 | 1222003663 |
oct | 315065461 |
9 | 122148357 |
10 | 53766961 |
11 | 28393a06 |
12 | 1600b181 |
13 | b1a6b91 |
14 | 71d8533 |
15 | 4ac0e41 |
hex | 3346b31 |
53766961 has 4 divisors (see below), whose sum is σ = 53981424. Its totient is φ = 53552500.
The previous prime is 53766929. The next prime is 53766967. The reversal of 53766961 is 16966735.
53766961 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, and also an emirpimes, since its reverse is a distinct semiprime: 16966735 = 5 ⋅3393347.
It is a cyclic number.
It is not a de Polignac number, because 53766961 - 25 = 53766929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53766967) 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, 106855 + ... + 107356.
It is an arithmetic number, because the mean of its divisors is an integer number (13495356).
Almost surely, 253766961 is an apocalyptic number.
It is an amenable number.
53766961 is a deficient number, since it is larger than the sum of its proper divisors (214463).
53766961 is a wasteful number, since it uses less digits than its factorization.
53766961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214462.
The product of its digits is 204120, while the sum is 43.
The square root of 53766961 is about 7332.5957886686. The cubic root of 53766961 is about 377.4318073393.
The spelling of 53766961 in words is "fifty-three million, seven hundred sixty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •