Base | Representation |
---|---|
bin | 1000000100010110… |
… | …11010000110011100 |
3 | 102011212111121201112 |
4 | 10002023122012130 |
5 | 32332331342340 |
6 | 1553451201152 |
7 | 212224150340 |
oct | 40213320634 |
9 | 12155447645 |
10 | 4331512220 |
11 | 1923031272 |
12 | a0a7461b8 |
13 | 5405038a9 |
14 | 2d13ab620 |
15 | 1a540b065 |
hex | 1022da19c |
4331512220 has 24 divisors (see below), whose sum is σ = 10395629664. Its totient is φ = 1485089856.
The previous prime is 4331512201. The next prime is 4331512223. The reversal of 4331512220 is 222151334.
It is a super-2 number, since 2×43315122202 = 37523996224018656800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4331512223) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 15469547 + ... + 15469826.
It is an arithmetic number, because the mean of its divisors is an integer number (433151236).
Almost surely, 24331512220 is an apocalyptic number.
It is an amenable number.
4331512220 is an abundant number, since it is smaller than the sum of its proper divisors (6064117444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4331512220 is a wasteful number, since it uses less digits than its factorization.
4331512220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30939389 (or 30939387 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 4331512220 is about 65814.2250581134. The cubic root of 4331512220 is about 1630.0959984612.
Adding to 4331512220 its reverse (222151334), we get a palindrome (4553663554).
The spelling of 4331512220 in words is "four billion, three hundred thirty-one million, five hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •