Base | Representation |
---|---|
bin | 1100010010000011110… |
… | …00001100001100000001 |
3 | 1111100021202010001202221 |
4 | 12021001320030030001 |
5 | 23403240040402113 |
6 | 521511502411041 |
7 | 42326565121336 |
oct | 6110170141401 |
9 | 1440252101687 |
10 | 422012044033 |
11 | 152a79884928 |
12 | 69956b90a81 |
13 | 30a45b19378 |
14 | 165d579a98d |
15 | ae9e10598d |
hex | 6241e0c301 |
422012044033 has 8 divisors (see below), whose sum is σ = 439854711296. Its totient is φ = 404433712800.
The previous prime is 422012044007. The next prime is 422012044037. The reversal of 422012044033 is 330440210224.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 422012044033 - 29 = 422012043521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422012043989 and 422012044007.
It is not an unprimeable number, because it can be changed into a prime (422012044037) 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, 66080748 + ... + 66087133.
It is an arithmetic number, because the mean of its divisors is an integer number (54981838912).
Almost surely, 2422012044033 is an apocalyptic number.
It is an amenable number.
422012044033 is a deficient number, since it is larger than the sum of its proper divisors (17842667263).
422012044033 is a wasteful number, since it uses less digits than its factorization.
422012044033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132168015.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 422012044033 its reverse (330440210224), we get a palindrome (752452254257).
The spelling of 422012044033 in words is "four hundred twenty-two billion, twelve million, forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •