Base | Representation |
---|---|
bin | 1111000001111… |
… | …0101010000011 |
3 | 11101121202210200 |
4 | 3300132222003 |
5 | 112114241011 |
6 | 10131100243 |
7 | 1363555320 |
oct | 360365203 |
9 | 141552720 |
10 | 63040131 |
11 | 32647a90 |
12 | 19141683 |
13 | 100a296b |
14 | 852db47 |
15 | 5803856 |
hex | 3c1ea83 |
63040131 has 48 divisors (see below), whose sum is σ = 120227328. Its totient is φ = 30816000.
The previous prime is 63040073. The next prime is 63040147. The reversal of 63040131 is 13104036.
63040131 is a `hidden beast` number, since 630 + 4 + 0 + 1 + 31 = 666.
63040131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 63040131 - 26 = 63040067 is a prime.
It is a super-2 number, since 2×630401312 = 7948116232994322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (63040151) 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 47 ways as a sum of consecutive naturals, for example, 9106 + ... + 14456.
It is an arithmetic number, because the mean of its divisors is an integer number (2504736).
Almost surely, 263040131 is an apocalyptic number.
63040131 is a deficient number, since it is larger than the sum of its proper divisors (57187197).
63040131 is a wasteful number, since it uses less digits than its factorization.
63040131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5392 (or 5389 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 63040131 is about 7939.7815461132. The cubic root of 63040131 is about 397.9901915043.
Adding to 63040131 its reverse (13104036), we get a palindrome (76144167).
The spelling of 63040131 in words is "sixty-three million, forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •