Base | Representation |
---|---|
bin | 11001010010010… |
… | …001110101000101 |
3 | 1002120020201012201 |
4 | 121102101311011 |
5 | 1332100101041 |
6 | 110032314501 |
7 | 13340553616 |
oct | 3122216505 |
9 | 1076221181 |
10 | 424222021 |
11 | 1a850a313 |
12 | ba0a2a31 |
13 | 69b72662 |
14 | 404abc0d |
15 | 2739a631 |
hex | 19491d45 |
424222021 has 8 divisors (see below), whose sum is σ = 430421120. Its totient is φ = 418043808.
The previous prime is 424222013. The next prime is 424222027. The reversal of 424222021 is 120222424.
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 424222021 - 23 = 424222013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 424222021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424222027) 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, 38305 + ... + 48121.
It is an arithmetic number, because the mean of its divisors is an integer number (53802640).
Almost surely, 2424222021 is an apocalyptic number.
It is an amenable number.
424222021 is a deficient number, since it is larger than the sum of its proper divisors (6199099).
424222021 is an equidigital number, since it uses as much as digits as its factorization.
424222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10443.
The product of its (nonzero) digits is 512, while the sum is 19.
The square root of 424222021 is about 20596.6507228724. The cubic root of 424222021 is about 751.3882560008.
Adding to 424222021 its reverse (120222424), we get a palindrome (544444445).
The spelling of 424222021 in words is "four hundred twenty-four million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •