Base | Representation |
---|---|
bin | 1110111000011… |
… | …1011000001001 |
3 | 11100110021210222 |
4 | 3232013120021 |
5 | 111434423424 |
6 | 10105515425 |
7 | 1355364635 |
oct | 356073011 |
9 | 140407728 |
10 | 62420489 |
11 | 3226448a |
12 | 18aa2b75 |
13 | cc16901 |
14 | 840bdc5 |
15 | 572ee5e |
hex | 3b87609 |
62420489 has 4 divisors (see below), whose sum is σ = 62540820. Its totient is φ = 62300160.
The previous prime is 62420473. The next prime is 62420503. The reversal of 62420489 is 98402426.
62420489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 43454464 + 18966025 = 6592^2 + 4355^2 .
It is a cyclic number.
It is not a de Polignac number, because 62420489 - 24 = 62420473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (62420389) 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, 59384 + ... + 60425.
It is an arithmetic number, because the mean of its divisors is an integer number (15635205).
Almost surely, 262420489 is an apocalyptic number.
It is an amenable number.
62420489 is a deficient number, since it is larger than the sum of its proper divisors (120331).
62420489 is a wasteful number, since it uses less digits than its factorization.
62420489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120330.
The product of its (nonzero) digits is 27648, while the sum is 35.
The square root of 62420489 is about 7900.6638328687. The cubic root of 62420489 is about 396.6819037843.
The spelling of 62420489 in words is "sixty-two million, four hundred twenty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •