Base | Representation |
---|---|
bin | 11001010010101… |
… | …100001111101101 |
3 | 1002120110012122010 |
4 | 121102230033231 |
5 | 1332112031341 |
6 | 110034511433 |
7 | 13341514230 |
oct | 3122541755 |
9 | 1076405563 |
10 | 424330221 |
11 | 1a8583637 |
12 | ba135579 |
13 | 69bac993 |
14 | 404d9417 |
15 | 273bc716 |
hex | 194ac3ed |
424330221 has 16 divisors (see below), whose sum is σ = 652644864. Its totient is φ = 240207024.
The previous prime is 424330219. The next prime is 424330223. The reversal of 424330221 is 122033424.
It is an interprime number because it is at equal distance from previous prime (424330219) and next prime (424330223).
It is not a de Polignac number, because 424330221 - 21 = 424330219 is a prime.
It is a super-2 number, since 2×4243302212 = 360112272907817682, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424330223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92175 + ... + 96668.
It is an arithmetic number, because the mean of its divisors is an integer number (40790304).
Almost surely, 2424330221 is an apocalyptic number.
It is an amenable number.
424330221 is a deficient number, since it is larger than the sum of its proper divisors (228314643).
424330221 is a wasteful number, since it uses less digits than its factorization.
424330221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188960.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 424330221 is about 20599.2771960571. The cubic root of 424330221 is about 751.4521323786.
Adding to 424330221 its reverse (122033424), we get a palindrome (546363645).
The spelling of 424330221 in words is "four hundred twenty-four million, three hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •