Base | Representation |
---|---|
bin | 100110000110000… |
… | …001011100110101 |
3 | 1122112121022020100 |
4 | 212012001130311 |
5 | 2302103104023 |
6 | 143230224313 |
7 | 21560241150 |
oct | 4606013465 |
9 | 1575538210 |
10 | 639113013 |
11 | 2a8843080 |
12 | 15a055099 |
13 | a25417a6 |
14 | 60c48c97 |
15 | 3b196c43 |
hex | 26181735 |
639113013 has 48 divisors (see below), whose sum is σ = 1211558400. Its totient is φ = 314526240.
The previous prime is 639113009. The next prime is 639113053. The reversal of 639113013 is 310311936.
639113013 is a `hidden beast` number, since 639 + 1 + 13 + 0 + 13 = 666.
It is not a de Polignac number, because 639113013 - 22 = 639113009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (639113053) 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, 11103 + ... + 37436.
It is an arithmetic number, because the mean of its divisors is an integer number (25240800).
Almost surely, 2639113013 is an apocalyptic number.
639113013 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
639113013 is a deficient number, since it is larger than the sum of its proper divisors (572445387).
639113013 is a wasteful number, since it uses less digits than its factorization.
639113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48582 (or 48579 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 27.
The square root of 639113013 is about 25280.6845832940. The cubic root of 639113013 is about 861.3755762104.
Adding to 639113013 its reverse (310311936), we get a palindrome (949424949).
The spelling of 639113013 in words is "six hundred thirty-nine million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •