Base | Representation |
---|---|
bin | 101111101111111010101110… |
… | …0110000100001001110011110 |
3 | 2001002002210212101221211011022 |
4 | 1133133311130300201032132 |
5 | 420022303311430201142 |
6 | 4045134150200524142 |
7 | 154316102620202243 |
oct | 13737653460411636 |
9 | 2032083771854138 |
10 | 420002113131422 |
11 | 111909994480638 |
12 | 3b133281a80652 |
13 | 1504804c5695c3 |
14 | 75a02d43ad5ca |
15 | 33853437726d2 |
hex | 17dfd5cc2139e |
420002113131422 has 32 divisors (see below), whose sum is σ = 663285287952000. Its totient is φ = 198911156023008.
The previous prime is 420002113131421. The next prime is 420002113131457. The reversal of 420002113131422 is 224131311200024.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 420002113131391 and 420002113131400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420002113131421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5508692033 + ... + 5508768275.
It is an arithmetic number, because the mean of its divisors is an integer number (20727665248500).
Almost surely, 2420002113131422 is an apocalyptic number.
420002113131422 is a deficient number, since it is larger than the sum of its proper divisors (243283174820578).
420002113131422 is a wasteful number, since it uses less digits than its factorization.
420002113131422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101480.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 420002113131422 its reverse (224131311200024), we get a palindrome (644133424331446).
The spelling of 420002113131422 in words is "four hundred twenty trillion, two billion, one hundred thirteen million, one hundred thirty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •