Base | Representation |
---|---|
bin | 101010011000010… |
… | …1100100001101001 |
3 | 10200002211200211121 |
4 | 1110300230201221 |
5 | 10403021121213 |
6 | 353035255241 |
7 | 50145144355 |
oct | 12460544151 |
9 | 3602750747 |
10 | 1422051433 |
11 | 66a790320 |
12 | 3382aa521 |
13 | 1987cc86a |
14 | d6c12465 |
15 | 84c9d88d |
hex | 54c2c869 |
1422051433 has 8 divisors (see below), whose sum is σ = 1552988736. Its totient is φ = 1291390800.
The previous prime is 1422051401. The next prime is 1422051439. The reversal of 1422051433 is 3341502241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1422051433 - 25 = 1422051401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1422051398 and 1422051407.
It is not an unprimeable number, because it can be changed into a prime (1422051439) 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, 58341 + ... + 79042.
It is an arithmetic number, because the mean of its divisors is an integer number (194123592).
Almost surely, 21422051433 is an apocalyptic number.
It is an amenable number.
1422051433 is a deficient number, since it is larger than the sum of its proper divisors (130937303).
1422051433 is a wasteful number, since it uses less digits than its factorization.
1422051433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138335.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 1422051433 is about 37710.0972287264. The cubic root of 1422051433 is about 1124.5318698892.
Adding to 1422051433 its reverse (3341502241), we get a palindrome (4763553674).
The spelling of 1422051433 in words is "one billion, four hundred twenty-two million, fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •