Base | Representation |
---|---|
bin | 1011101101001111000… |
… | …00101010000010110110 |
3 | 1102110020221212202010010 |
4 | 11312213200222002312 |
5 | 23042243013030142 |
6 | 504442040441050 |
7 | 41026640154564 |
oct | 5664740520266 |
9 | 1373227782103 |
10 | 402242314422 |
11 | 145654333413 |
12 | 65b5a179186 |
13 | 2bc15066b00 |
14 | 1567bcd6a34 |
15 | a6e36c2e9c |
hex | 5da782a0b6 |
402242314422 has 48 divisors (see below), whose sum is σ = 885409254288. Its totient is φ = 121737882240.
The previous prime is 402242314403. The next prime is 402242314423. The reversal of 402242314422 is 224413242204.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 402242314422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402242314423) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 3189693 + ... + 3313400.
It is an arithmetic number, because the mean of its divisors is an integer number (18446026131).
Almost surely, 2402242314422 is an apocalyptic number.
402242314422 is an abundant number, since it is smaller than the sum of its proper divisors (483166939866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402242314422 is a wasteful number, since it uses less digits than its factorization.
402242314422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6503185 (or 6503172 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 30.
Adding to 402242314422 its reverse (224413242204), we get a palindrome (626655556626).
The spelling of 402242314422 in words is "four hundred two billion, two hundred forty-two million, three hundred fourteen thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •