Base | Representation |
---|---|
bin | 1100100001000011100… |
… | …00101101100100000000 |
3 | 1112010001211200111010111 |
4 | 12100201300231210000 |
5 | 24021232131203024 |
6 | 525322425441104 |
7 | 43033236302452 |
oct | 6204160554400 |
9 | 1463054614114 |
10 | 430063147264 |
11 | 156430486953 |
12 | 6b423340194 |
13 | 31729b12a8a |
14 | 16b5ab682d2 |
15 | b2c0d47a94 |
hex | 6421c2d900 |
430063147264 has 81 divisors (see below), whose sum is σ = 912291995041. Its totient is φ = 202298716160.
The previous prime is 430063147187. The next prime is 430063147277. The reversal of 430063147264 is 462741360034.
It is a happy number.
The square root of 430063147264 is 655792.
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., 334824249600 + 95238897664 = 578640^2 + 308608^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 178374219 + ... + 178376629.
Almost surely, 2430063147264 is an apocalyptic number.
430063147264 is the 655792-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 430063147264
430063147264 is an abundant number, since it is smaller than the sum of its proper divisors (482228847777).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
430063147264 is an frugal number, since it uses more digits than its factorization.
430063147264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4872 (or 2430 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 40.
The spelling of 430063147264 in words is "four hundred thirty billion, sixty-three million, one hundred forty-seven thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •