Base | Representation |
---|---|
bin | 1111000011001… |
… | …1011011101111 |
3 | 11101210002112112 |
4 | 3300303123233 |
5 | 112130001411 |
6 | 10132554235 |
7 | 1364361401 |
oct | 360633357 |
9 | 141702475 |
10 | 63125231 |
11 | 326a5a14 |
12 | 1918297b |
13 | 10102610 |
14 | 8552b71 |
15 | 581db8b |
hex | 3c336ef |
63125231 has 4 divisors (see below), whose sum is σ = 67981032. Its totient is φ = 58269432.
The previous prime is 63125213. The next prime is 63125243. The reversal of 63125231 is 13252136.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-63125231 is a prime.
It is a super-2 number, since 2×631252312 = 7969589577606722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63125197 and 63125206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63125261) 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, 2427881 + ... + 2427906.
It is an arithmetic number, because the mean of its divisors is an integer number (16995258).
Almost surely, 263125231 is an apocalyptic number.
63125231 is a deficient number, since it is larger than the sum of its proper divisors (4855801).
63125231 is a wasteful number, since it uses less digits than its factorization.
63125231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4855800.
The product of its digits is 1080, while the sum is 23.
The square root of 63125231 is about 7945.1388282396. The cubic root of 63125231 is about 398.1691977759.
Adding to 63125231 its reverse (13252136), we get a palindrome (76377367).
The spelling of 63125231 in words is "sixty-three million, one hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •