Base | Representation |
---|---|
bin | 11001001010010… |
… | …010001011110100 |
3 | 1002102022020110022 |
4 | 121022102023310 |
5 | 1331031020244 |
6 | 105515344312 |
7 | 13314004664 |
oct | 3112221364 |
9 | 1072266408 |
10 | 422126324 |
11 | 1a7308834 |
12 | b9452098 |
13 | 695ba7b9 |
14 | 400c41a4 |
15 | 270d46ee |
hex | 192922f4 |
422126324 has 24 divisors (see below), whose sum is σ = 757780296. Its totient is φ = 205632000.
The previous prime is 422126323. The next prime is 422126329. The reversal of 422126324 is 423621224.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 21325924 + 400800400 = 4618^2 + 20020^2 .
It is a junction number, because it is equal to n+sod(n) for n = 422126293 and 422126302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422126321) 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, 166184 + ... + 168704.
It is an arithmetic number, because the mean of its divisors is an integer number (31574179).
Almost surely, 2422126324 is an apocalyptic number.
It is an amenable number.
422126324 is a deficient number, since it is larger than the sum of its proper divisors (335653972).
422126324 is a wasteful number, since it uses less digits than its factorization.
422126324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3587 (or 3585 counting only the distinct ones).
The product of its digits is 4608, while the sum is 26.
The square root of 422126324 is about 20545.7130321632. The cubic root of 422126324 is about 750.1489031759.
Adding to 422126324 its reverse (423621224), we get a palindrome (845747548).
The spelling of 422126324 in words is "four hundred twenty-two million, one hundred twenty-six thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •