Base | Representation |
---|---|
bin | 1111000010001… |
… | …1001011000111 |
3 | 11101122201011212 |
4 | 3300203023013 |
5 | 112120334011 |
6 | 10131322035 |
7 | 1363663256 |
oct | 360431307 |
9 | 141581155 |
10 | 63058631 |
11 | 3265a979 |
12 | 1915031b |
13 | 100ab1cc |
14 | 853679d |
15 | 580908b |
hex | 3c232c7 |
63058631 has 8 divisors (see below), whose sum is σ = 65007360. Its totient is φ = 61135288.
The previous prime is 63058621. The next prime is 63058637. The reversal of 63058631 is 13685036.
63058631 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 a de Polignac number, because none of the positive numbers 2k-63058631 is a prime.
It is a super-2 number, since 2×630586312 = 7952781887188322, 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 (63058637) 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, 1241 + ... + 11298.
It is an arithmetic number, because the mean of its divisors is an integer number (8125920).
Almost surely, 263058631 is an apocalyptic number.
63058631 is a deficient number, since it is larger than the sum of its proper divisors (1948729).
63058631 is a wasteful number, since it uses less digits than its factorization.
63058631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12693.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 63058631 is about 7940.9464801118. The cubic root of 63058631 is about 398.0291196088.
The spelling of 63058631 in words is "sixty-three million, fifty-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •