Base | Representation |
---|---|
bin | 11001000111101… |
… | …011010111001110 |
3 | 1002101000112010211 |
4 | 121013223113032 |
5 | 1330342134042 |
6 | 105452553034 |
7 | 13305130600 |
oct | 3107532716 |
9 | 1071015124 |
10 | 421443022 |
11 | 1a6991420 |
12 | b918277a |
13 | 6940b790 |
14 | 3dd87170 |
15 | 26eec017 |
hex | 191eb5ce |
421443022 has 192 divisors, whose sum is σ = 961813440. Its totient is φ = 135475200.
The previous prime is 421442969. The next prime is 421443049. The reversal of 421443022 is 220344124.
It is a happy number.
It is a super-2 number, since 2×4214430222 = 355228441584984968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 421442984 and 421443002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6908872 + ... + 6908932.
It is an arithmetic number, because the mean of its divisors is an integer number (5009445).
Almost surely, 2421443022 is an apocalyptic number.
421443022 is an abundant number, since it is smaller than the sum of its proper divisors (540370418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421443022 is a wasteful number, since it uses less digits than its factorization.
421443022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 421443022 is about 20529.0774756198. The cubic root of 421443022 is about 749.7439256149.
Adding to 421443022 its reverse (220344124), we get a palindrome (641787146).
The spelling of 421443022 in words is "four hundred twenty-one million, four hundred forty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •