Base | Representation |
---|---|
bin | 1110111100010… |
… | …0010100110010 |
3 | 11100220222020221 |
4 | 3233010110302 |
5 | 112020421010 |
6 | 10115123254 |
7 | 1360454515 |
oct | 357042462 |
9 | 140828227 |
10 | 62670130 |
11 | 32414aa6 |
12 | 18ba352a |
13 | cca3423 |
14 | 8474d7c |
15 | 577ddda |
hex | 3bc4532 |
62670130 has 8 divisors (see below), whose sum is σ = 112806252. Its totient is φ = 25068048.
The previous prime is 62670121. The next prime is 62670133. The reversal of 62670130 is 3107626.
62670130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 56385081 + 6285049 = 7509^2 + 2507^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 62670095 and 62670104.
It is not an unprimeable number, because it can be changed into a prime (62670133) 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 3 ways as a sum of consecutive naturals, for example, 3133497 + ... + 3133516.
Almost surely, 262670130 is an apocalyptic number.
62670130 is a deficient number, since it is larger than the sum of its proper divisors (50136122).
62670130 is a wasteful number, since it uses less digits than its factorization.
62670130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6267020.
The product of its (nonzero) digits is 1512, while the sum is 25.
The square root of 62670130 is about 7916.4468039645. The cubic root of 62670130 is about 397.2100228122.
Adding to 62670130 its reverse (3107626), we get a palindrome (65777756).
It can be divided in two parts, 626 and 70130, that added together give a square (70756 = 2662).
The spelling of 62670130 in words is "sixty-two million, six hundred seventy thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •