Base | Representation |
---|---|
bin | 1000000100010110… |
… | …01001000011101011 |
3 | 102011212101001222000 |
4 | 10002023021003223 |
5 | 32332322124121 |
6 | 1553445502043 |
7 | 212223436662 |
oct | 40213110353 |
9 | 12155331860 |
10 | 4331442411 |
11 | 1922a9387a |
12 | a0a711923 |
13 | 5404aab9a |
14 | 2d138ddd9 |
15 | 1a53e5526 |
hex | 1022c90eb |
4331442411 has 16 divisors (see below), whose sum is σ = 6418168320. Its totient is φ = 2887080840.
The previous prime is 4331442373. The next prime is 4331442439. The reversal of 4331442411 is 1142441334.
It is not a de Polignac number, because 4331442411 - 29 = 4331441899 is a prime.
It is a super-2 number, since 2×43314424112 = 37522786719618985842, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (4331442491) 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 15 ways as a sum of consecutive naturals, for example, 171546 + ... + 195168.
It is an arithmetic number, because the mean of its divisors is an integer number (401135520).
Almost surely, 24331442411 is an apocalyptic number.
4331442411 is a deficient number, since it is larger than the sum of its proper divisors (2086725909).
4331442411 is a wasteful number, since it uses less digits than its factorization.
4331442411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30423 (or 30417 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 4331442411 is about 65813.6947071048. The cubic root of 4331442411 is about 1630.0872412437.
Adding to 4331442411 its reverse (1142441334), we get a palindrome (5473883745).
The spelling of 4331442411 in words is "four billion, three hundred thirty-one million, four hundred forty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •