Base | Representation |
---|---|
bin | 1101101011000010110… |
… | …01011100111011000001 |
3 | 1122220121011021221110021 |
4 | 12311201121130323001 |
5 | 30144110041403111 |
6 | 555452205333441 |
7 | 45640502561212 |
oct | 6654131347301 |
9 | 1586534257407 |
10 | 469785497281 |
11 | 1712647363a1 |
12 | 7706a267281 |
13 | 353ba4c14b9 |
14 | 18a484dd409 |
15 | c348287d71 |
hex | 6d6165cec1 |
469785497281 has 9 divisors (see below), whose sum is σ = 473285545473. Its totient is φ = 466311159060.
The previous prime is 469785497267. The next prime is 469785497287. The reversal of 469785497281 is 182794587964.
The square root of 469785497281 is 685409.
It is a perfect power (a square), and thus also a powerful number.
It is a de Polignac number, because none of the positive numbers 2k-469785497281 is a prime.
It is a super-2 number, since 2×4697854972812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 469785497281.
It is not an unprimeable number, because it can be changed into a prime (469785497287) 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, 95269386 + ... + 95274316.
Almost surely, 2469785497281 is an apocalyptic number.
469785497281 is the 685409-th square number.
469785497281 is the 342705-th centered octagonal number.
It is an amenable number.
469785497281 is a deficient number, since it is larger than the sum of its proper divisors (3500048192).
469785497281 is an frugal number, since it uses more digits than its factorization.
469785497281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10140 (or 5070 counting only the distinct ones).
The product of its digits is 243855360, while the sum is 70.
The spelling of 469785497281 in words is "four hundred sixty-nine billion, seven hundred eighty-five million, four hundred ninety-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •