Base | Representation |
---|---|
bin | 1100100100101101001… |
… | …10001101110111010000 |
3 | 1112022010110010002200120 |
4 | 12102112212031313100 |
5 | 24034240433032011 |
6 | 530245131150240 |
7 | 43132640500620 |
oct | 6222646156720 |
9 | 1468113102616 |
10 | 432023330256 |
11 | 1572469a83a1 |
12 | 6b88b8a5380 |
13 | 3197cc5897b |
14 | 16ca521a880 |
15 | b387e92a06 |
hex | 649698ddd0 |
432023330256 has 160 divisors (see below), whose sum is σ = 1316715248640. Its totient is φ = 119497254912.
The previous prime is 432023330161. The next prime is 432023330257. The reversal of 432023330256 is 652033320234.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (432023330257) 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 31 ways as a sum of consecutive naturals, for example, 1500315 + ... + 1764933.
It is an arithmetic number, because the mean of its divisors is an integer number (8229470304).
Almost surely, 2432023330256 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 432023330256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (658357624320).
432023330256 is an abundant number, since it is smaller than the sum of its proper divisors (884691918384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
432023330256 is a wasteful number, since it uses less digits than its factorization.
432023330256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264793 (or 264787 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 33.
The spelling of 432023330256 in words is "four hundred thirty-two billion, twenty-three million, three hundred thirty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •