Base | Representation |
---|---|
bin | 1111001000110… |
… | …0100110110011 |
3 | 11102110122120101 |
4 | 3302030212303 |
5 | 112223143413 |
6 | 10144453231 |
7 | 1400442310 |
oct | 362144663 |
9 | 142418511 |
10 | 63490483 |
11 | 32925381 |
12 | 1931a217 |
13 | 101cc944 |
14 | 8609d07 |
15 | 5891edd |
hex | 3c8c9b3 |
63490483 has 32 divisors (see below), whose sum is σ = 78796800. Its totient is φ = 50004864.
The previous prime is 63490451. The next prime is 63490487. The reversal of 63490483 is 38409436.
It is not a de Polignac number, because 63490483 - 25 = 63490451 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (63490487) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 593316 + ... + 593422.
It is an arithmetic number, because the mean of its divisors is an integer number (2462400).
Almost surely, 263490483 is an apocalyptic number.
63490483 is a deficient number, since it is larger than the sum of its proper divisors (15306317).
63490483 is a wasteful number, since it uses less digits than its factorization.
63490483 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259.
The product of its (nonzero) digits is 62208, while the sum is 37.
The square root of 63490483 is about 7968.0915531889. The cubic root of 63490483 is about 398.9356768021.
The spelling of 63490483 in words is "sixty-three million, four hundred ninety thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •