Base | Representation |
---|---|
bin | 1100100001001101000… |
… | …01111011010101101001 |
3 | 1112010021102020102200121 |
4 | 12100212201323111221 |
5 | 24021413122020414 |
6 | 525334404403241 |
7 | 43035230340664 |
oct | 6204641732551 |
9 | 1463242212617 |
10 | 430143157609 |
11 | 156471664900 |
12 | 6b4460a6521 |
13 | 31740577a89 |
14 | 16b676346db |
15 | b2c7d9e724 |
hex | 642687b569 |
430143157609 has 27 divisors (see below), whose sum is σ = 478053362871. Its totient is φ = 386743397040.
The previous prime is 430143157597. The next prime is 430143157627. The reversal of 430143157609 is 906751341034.
The square root of 430143157609 is 655853.
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., 299807717209 + 130335440400 = 547547^2 + 361020^2 .
It is not a de Polignac number, because 430143157609 - 227 = 430008939881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (430143137609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 786367474 + ... + 786368020.
Almost surely, 2430143157609 is an apocalyptic number.
430143157609 is the 655853-rd square number.
430143157609 is the 327927-th centered octagonal number.
It is an amenable number.
430143157609 is a deficient number, since it is larger than the sum of its proper divisors (47910205262).
430143157609 is an frugal number, since it uses more digits than its factorization.
430143157609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334 (or 667 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 43.
The spelling of 430143157609 in words is "four hundred thirty billion, one hundred forty-three million, one hundred fifty-seven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •