Base | Representation |
---|---|
bin | 11001010010010… |
… | …010001001001111 |
3 | 1002120020202222111 |
4 | 121102102021033 |
5 | 1332100121221 |
6 | 110032324451 |
7 | 13340560441 |
oct | 3122221117 |
9 | 1076222874 |
10 | 424223311 |
11 | 1a8510286 |
12 | ba0a3727 |
13 | 69b73115 |
14 | 404ac491 |
15 | 2739abe1 |
hex | 1949224f |
424223311 has 4 divisors (see below), whose sum is σ = 426826072. Its totient is φ = 421620552.
The previous prime is 424223299. The next prime is 424223323. The reversal of 424223311 is 113322424.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (424223299) and next prime (424223323).
It is a cyclic number.
It is not a de Polignac number, because 424223311 - 213 = 424215119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424223011) 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 3 ways as a sum of consecutive naturals, for example, 1301136 + ... + 1301461.
It is an arithmetic number, because the mean of its divisors is an integer number (106706518).
Almost surely, 2424223311 is an apocalyptic number.
424223311 is a deficient number, since it is larger than the sum of its proper divisors (2602761).
424223311 is a wasteful number, since it uses less digits than its factorization.
424223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602760.
The product of its digits is 1152, while the sum is 22.
The square root of 424223311 is about 20596.6820386197. The cubic root of 424223311 is about 751.3890176223.
Adding to 424223311 its reverse (113322424), we get a palindrome (537545735).
The spelling of 424223311 in words is "four hundred twenty-four million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •