Base | Representation |
---|---|
bin | 1111000100100… |
… | …1101000000101 |
3 | 11101221201020021 |
4 | 3301021220011 |
5 | 112140404013 |
6 | 10134535141 |
7 | 1365220411 |
oct | 361115005 |
9 | 141851207 |
10 | 63216133 |
11 | 32758242 |
12 | 192074b1 |
13 | 10134ac6 |
14 | 8577d41 |
15 | 583aa8d |
hex | 3c49a05 |
63216133 has 4 divisors (see below), whose sum is σ = 63292320. Its totient is φ = 63139948.
The previous prime is 63216071. The next prime is 63216151. The reversal of 63216133 is 33161236.
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 a de Polignac number, because none of the positive numbers 2k-63216133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63216098 and 63216107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63216163) 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, 36835 + ... + 38512.
It is an arithmetic number, because the mean of its divisors is an integer number (15823080).
Almost surely, 263216133 is an apocalyptic number.
It is an amenable number.
63216133 is a deficient number, since it is larger than the sum of its proper divisors (76187).
63216133 is an equidigital number, since it uses as much as digits as its factorization.
63216133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76186.
The product of its digits is 1944, while the sum is 25.
The square root of 63216133 is about 7950.8573751514. The cubic root of 63216133 is about 398.3602308282.
Adding to 63216133 its reverse (33161236), we get a palindrome (96377369).
The spelling of 63216133 in words is "sixty-three million, two hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •