Base | Representation |
---|---|
bin | 1100001110010110010… |
… | …01001001100101101011 |
3 | 1111011010220201210122012 |
4 | 12013023021021211223 |
5 | 23340200110014011 |
6 | 520542102150135 |
7 | 42226326050153 |
oct | 6071311114553 |
9 | 1434126653565 |
10 | 420020001131 |
11 | 152147382585 |
12 | 6949ba2234b |
13 | 307b91c9a63 |
14 | 16486db3763 |
15 | add42b5a8b |
hex | 61cb24996b |
420020001131 has 8 divisors (see below), whose sum is σ = 442142182800. Its totient is φ = 397899406080.
The previous prime is 420020001127. The next prime is 420020001133. The reversal of 420020001131 is 131100020024.
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 420020001131 - 22 = 420020001127 is a prime.
It is a super-3 number, since 3×4200200011313 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (420020001133) 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 7 ways as a sum of consecutive naturals, for example, 167315 + ... + 931683.
It is an arithmetic number, because the mean of its divisors is an integer number (55267772850).
Almost surely, 2420020001131 is an apocalyptic number.
420020001131 is a deficient number, since it is larger than the sum of its proper divisors (22122181669).
420020001131 is a wasteful number, since it uses less digits than its factorization.
420020001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793309.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 420020001131 its reverse (131100020024), we get a palindrome (551120021155).
The spelling of 420020001131 in words is "four hundred twenty billion, twenty million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •