Base | Representation |
---|---|
bin | 1010100000000101000… |
… | …11010100100010111001 |
3 | 1021111100011121112020021 |
4 | 11100002203110202321 |
5 | 21402424414111424 |
6 | 433431454130441 |
7 | 35032312650421 |
oct | 5200243244271 |
9 | 1244304545207 |
10 | 360820066489 |
11 | 12a028580463 |
12 | 59b19ab0a21 |
13 | 2804344642c |
14 | 1366c8a5481 |
15 | 95bbdee4e4 |
hex | 54028d48b9 |
360820066489 has 9 divisors (see below), whose sum is σ = 361882184079. Its totient is φ = 359761062360.
The previous prime is 360820066487. The next prime is 360820066513. The reversal of 360820066489 is 984660028063.
The square root of 360820066489 is 600683.
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., 115656446889 + 245163619600 = 340083^2 + 495140^2 .
It is not a de Polignac number, because 360820066489 - 21 = 360820066487 is a prime.
It is a super-2 number, since 2×3608200664892 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (360820066487) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 276914212 + ... + 276915514.
Almost surely, 2360820066489 is an apocalyptic number.
360820066489 is the 600683-rd square number.
360820066489 is the 300342-nd centered octagonal number.
It is an amenable number.
360820066489 is a deficient number, since it is larger than the sum of its proper divisors (1062117590).
360820066489 is an frugal number, since it uses more digits than its factorization.
360820066489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3528 (or 1764 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 52.
The spelling of 360820066489 in words is "three hundred sixty billion, eight hundred twenty million, sixty-six thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •