Base | Representation |
---|---|
bin | 11101101110010… |
… | …010011110011001 |
3 | 1021202100020112011 |
4 | 131232102132121 |
5 | 2010130023221 |
6 | 121252145521 |
7 | 15233440531 |
oct | 3556223631 |
9 | 1252306464 |
10 | 498673561 |
11 | 236540911 |
12 | 11b0082a1 |
13 | 7c40c419 |
14 | 4a32c4c1 |
15 | 2dba51e1 |
hex | 1db92799 |
498673561 has 9 divisors (see below), whose sum is σ = 505440831. Its totient is φ = 491996592.
The previous prime is 498673547. The next prime is 498673579. The reversal of 498673561 is 165376894.
The square root of 498673561 is 22331.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 292923225 + 205750336 = 17115^2 + 14344^2 .
It is not a de Polignac number, because 498673561 - 27 = 498673433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (498673961) 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 8 ways as a sum of consecutive naturals, for example, 3059266 + ... + 3059428.
Almost surely, 2498673561 is an apocalyptic number.
498673561 is the 22331-st square number.
498673561 is the 11166-th centered octagonal number.
It is an amenable number.
498673561 is a deficient number, since it is larger than the sum of its proper divisors (6767270).
498673561 is an frugal number, since it uses more digits than its factorization.
498673561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600 (or 300 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 49.
The cubic root of 498673561 is about 792.9980408603.
Multiplying 498673561 by its sum of digits (49), we get a square (24435004489 = 1563172).
The spelling of 498673561 in words is "four hundred ninety-eight million, six hundred seventy-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •