Base | Representation |
---|---|
bin | 1111000100010… |
… | …1111111101101 |
3 | 11101220221211110 |
4 | 3301011333231 |
5 | 112134420021 |
6 | 10134342233 |
7 | 1365126144 |
oct | 361057755 |
9 | 141827743 |
10 | 63201261 |
11 | 32748052 |
12 | 191ba979 |
13 | 1012b0c6 |
14 | 857275b |
15 | 5836476 |
hex | 3c45fed |
63201261 has 4 divisors (see below), whose sum is σ = 84268352. Its totient is φ = 42134172.
The previous prime is 63201247. The next prime is 63201269. The reversal of 63201261 is 16210236.
It is a happy number.
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 not a de Polignac number, because 63201261 - 26 = 63201197 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 (63201269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10533541 + ... + 10533546.
It is an arithmetic number, because the mean of its divisors is an integer number (21067088).
Almost surely, 263201261 is an apocalyptic number.
It is an amenable number.
63201261 is a deficient number, since it is larger than the sum of its proper divisors (21067091).
63201261 is a wasteful number, since it uses less digits than its factorization.
63201261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21067090.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 63201261 is about 7949.9220750898. The cubic root of 63201261 is about 398.3289894467.
Adding to 63201261 its reverse (16210236), we get a palindrome (79411497).
Subtracting from 63201261 its reverse (16210236), we obtain a square (46991025 = 68552).
The spelling of 63201261 in words is "sixty-three million, two hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •