Base | Representation |
---|---|
bin | 1111000011100… |
… | …0010110001101 |
3 | 11101211010010221 |
4 | 3300320112031 |
5 | 112131122412 |
6 | 10133231341 |
7 | 1364504152 |
oct | 360702615 |
9 | 141733127 |
10 | 63145357 |
11 | 3270a050 |
12 | 19192551 |
13 | 1010b822 |
14 | 855a229 |
15 | 5824b07 |
hex | 3c3858d |
63145357 has 8 divisors (see below), whose sum is σ = 71108352. Its totient is φ = 55552800.
The previous prime is 63145343. The next prime is 63145363. The reversal of 63145357 is 75354136.
63145357 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 not a de Polignac number, because 63145357 - 211 = 63143309 is a prime.
It is a super-2 number, since 2×631453572 = 7974672221314898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63145307) 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, 92248 + ... + 92929.
It is an arithmetic number, because the mean of its divisors is an integer number (8888544).
Almost surely, 263145357 is an apocalyptic number.
It is an amenable number.
63145357 is a deficient number, since it is larger than the sum of its proper divisors (7962995).
63145357 is a wasteful number, since it uses less digits than its factorization.
63145357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185219.
The product of its digits is 37800, while the sum is 34.
The square root of 63145357 is about 7946.4052879274. The cubic root of 63145357 is about 398.2115089176.
The spelling of 63145357 in words is "sixty-three million, one hundred forty-five thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •