Base | Representation |
---|---|
bin | 101010100111111… |
… | …1111101110110100 |
3 | 10200200021120011100 |
4 | 1111033333232310 |
5 | 10412121202224 |
6 | 353531210100 |
7 | 50304660132 |
oct | 12517775664 |
9 | 3620246140 |
10 | 1430256564 |
11 | 674384a20 |
12 | 33aba6930 |
13 | 19a413479 |
14 | d7d4a752 |
15 | 8586eac9 |
hex | 553ffbb4 |
1430256564 has 144 divisors (see below), whose sum is σ = 4136356224. Its totient is φ = 412473600.
The previous prime is 1430256551. The next prime is 1430256599. The reversal of 1430256564 is 4656520341.
1430256564 is a `hidden beast` number, since 1 + 4 + 30 + 2 + 565 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3397074 + ... + 3397494.
It is an arithmetic number, because the mean of its divisors is an integer number (28724696).
Almost surely, 21430256564 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1430256564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2068178112).
1430256564 is an abundant number, since it is smaller than the sum of its proper divisors (2706099660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1430256564 is a wasteful number, since it uses less digits than its factorization.
1430256564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838 (or 833 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 1430256564 is about 37818.7329771900. The cubic root of 1430256564 is about 1126.6905451486.
The spelling of 1430256564 in words is "one billion, four hundred thirty million, two hundred fifty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •