Base | Representation |
---|---|
bin | 101010100111101… |
… | …1001110110101110 |
3 | 10200122222200100100 |
4 | 1111033121312232 |
5 | 10412101221142 |
6 | 353524011530 |
7 | 50303442621 |
oct | 12517316656 |
9 | 3618880310 |
10 | 1430101422 |
11 | 674289402 |
12 | 33ab30ba6 |
13 | 19a38a979 |
14 | d7d09db8 |
15 | 8583db4c |
hex | 553d9dae |
1430101422 has 24 divisors (see below), whose sum is σ = 3114783360. Its totient is φ = 474203520.
The previous prime is 1430101411. The next prime is 1430101441. The reversal of 1430101422 is 2241010341.
1430101422 is a `hidden beast` number, since 143 + 0 + 101 + 422 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1430101395 and 1430101404.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 204547 + ... + 211422.
It is an arithmetic number, because the mean of its divisors is an integer number (129782640).
Almost surely, 21430101422 is an apocalyptic number.
1430101422 is an abundant number, since it is smaller than the sum of its proper divisors (1684681938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1430101422 is a wasteful number, since it uses less digits than its factorization.
1430101422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416168 (or 416165 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 1430101422 is about 37816.6817952078. The cubic root of 1430101422 is about 1126.6498057574.
Adding to 1430101422 its reverse (2241010341), we get a palindrome (3671111763).
The spelling of 1430101422 in words is "one billion, four hundred thirty million, one hundred one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •