Base | Representation |
---|---|
bin | 101100011011001… |
… | …0010101101111001 |
3 | 10211212212201110001 |
4 | 1120312102231321 |
5 | 11023100034244 |
6 | 403525153001 |
7 | 51640060423 |
oct | 13066225571 |
9 | 3755781401 |
10 | 1490627449 |
11 | 6a5469513 |
12 | 35725b761 |
13 | 1a9a9019c |
14 | 101d83813 |
15 | 8ace75d4 |
hex | 58d92b79 |
1490627449 has 4 divisors (see below), whose sum is σ = 1492308864. Its totient is φ = 1488946036.
The previous prime is 1490627443. The next prime is 1490627459. The reversal of 1490627449 is 9447260941.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1490627449 - 217 = 1490496377 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1490627399 and 1490627408.
It is not an unprimeable number, because it can be changed into a prime (1490627443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 839377 + ... + 841150.
It is an arithmetic number, because the mean of its divisors is an integer number (373077216).
Almost surely, 21490627449 is an apocalyptic number.
It is an amenable number.
1490627449 is a deficient number, since it is larger than the sum of its proper divisors (1681415).
1490627449 is an equidigital number, since it uses as much as digits as its factorization.
1490627449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681414.
The product of its (nonzero) digits is 435456, while the sum is 46.
The square root of 1490627449 is about 38608.6447444092. The cubic root of 1490627449 is about 1142.3250611013.
The spelling of 1490627449 in words is "one billion, four hundred ninety million, six hundred twenty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •