Base | Representation |
---|---|
bin | 101010011001000… |
… | …1001000110100110 |
3 | 10200010112221222221 |
4 | 1110302021012212 |
5 | 10403120240010 |
6 | 353051342554 |
7 | 50151314035 |
oct | 12462110646 |
9 | 3603487887 |
10 | 1422430630 |
11 | 66aa1a205 |
12 | 338451a5a |
13 | 19890333a |
14 | d6cb071c |
15 | 84d25dda |
hex | 54c891a6 |
1422430630 has 128 divisors (see below), whose sum is σ = 3056901120. Its totient is φ = 472412160.
The previous prime is 1422430621. The next prime is 1422430637. The reversal of 1422430630 is 360342241.
It is a junction number, because it is equal to n+sod(n) for n = 1422430595 and 1422430604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422430637) 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 63 ways as a sum of consecutive naturals, for example, 3045657 + ... + 3046123.
It is an arithmetic number, because the mean of its divisors is an integer number (23882040).
Almost surely, 21422430630 is an apocalyptic number.
1422430630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1422430630 is an abundant number, since it is smaller than the sum of its proper divisors (1634470490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1422430630 is a wasteful number, since it uses less digits than its factorization.
1422430630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 1422430630 is about 37715.1246849324. The cubic root of 1422430630 is about 1124.6318149884.
Adding to 1422430630 its reverse (360342241), we get a palindrome (1782772871).
The spelling of 1422430630 in words is "one billion, four hundred twenty-two million, four hundred thirty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •