Base | Representation |
---|---|
bin | 1000000110110101… |
… | …10010110111010000 |
3 | 102020022122220210001 |
4 | 10003122302313100 |
5 | 32403143314044 |
6 | 1555513215344 |
7 | 212566064260 |
oct | 40332626720 |
9 | 12208586701 |
10 | 4352323024 |
11 | 1933855785 |
12 | a15701554 |
13 | 54490c08a |
14 | 2d40677a0 |
15 | 1a716c2d4 |
hex | 1036b2dd0 |
4352323024 has 80 divisors (see below), whose sum is σ = 9917365248. Its totient is φ = 1811275776.
The previous prime is 4352323009. The next prime is 4352323037. The reversal of 4352323024 is 4203232534.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 4352322983 and 4352323001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3575664 + ... + 3576880.
Almost surely, 24352323024 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 4352323024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4958682624).
4352323024 is an abundant number, since it is smaller than the sum of its proper divisors (5565042224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4352323024 is a wasteful number, since it uses less digits than its factorization.
4352323024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132 (or 2126 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 28.
The square root of 4352323024 is about 65972.1382403208. The cubic root of 4352323024 is about 1632.7024341474.
Adding to 4352323024 its reverse (4203232534), we get a palindrome (8555555558).
The spelling of 4352323024 in words is "four billion, three hundred fifty-two million, three hundred twenty-three thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •