Base | Representation |
---|---|
bin | 1000000001000110… |
… | …10001100001011111 |
3 | 102002222010201202110 |
4 | 10000203101201133 |
5 | 32303334322421 |
6 | 1551034125103 |
7 | 211443134121 |
oct | 40043214137 |
9 | 12088121673 |
10 | 4304214111 |
11 | 190968684a |
12 | a01580793 |
13 | 537966672 |
14 | 2cb903211 |
15 | 1a2d17a76 |
hex | 1008d185f |
4304214111 has 8 divisors (see below), whose sum is σ = 5847234480. Its totient is φ = 2815334912.
The previous prime is 4304214097. The next prime is 4304214113. The reversal of 4304214111 is 1114124034.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4304214111 - 27 = 4304213983 is a prime.
It is a super-2 number, since 2×43042141112 = 37052518226663040642, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4304214113) 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, 13535106 + ... + 13535423.
It is an arithmetic number, because the mean of its divisors is an integer number (730904310).
Almost surely, 24304214111 is an apocalyptic number.
4304214111 is a deficient number, since it is larger than the sum of its proper divisors (1543020369).
4304214111 is a wasteful number, since it uses less digits than its factorization.
4304214111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27070585.
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 4304214111 is about 65606.5096693918. The cubic root of 4304214111 is about 1626.6643757853.
Adding to 4304214111 its reverse (1114124034), we get a palindrome (5418338145).
The spelling of 4304214111 in words is "four billion, three hundred four million, two hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •