Base | Representation |
---|---|
bin | 101111110000101101111001… |
… | …0101001011110110111000101 |
3 | 2001002111022111202100100120010 |
4 | 1133201123302221132313011 |
5 | 420031103340011122100 |
6 | 4045300442301500433 |
7 | 154330043022462510 |
oct | 13741336251366705 |
9 | 2032438452310503 |
10 | 420112002051525 |
11 | 111951554951783 |
12 | 3b15062b571719 |
13 | 15055512a43754 |
14 | 75a575a919d77 |
15 | 3388125c27750 |
hex | 17e16f2a5edc5 |
420112002051525 has 48 divisors (see below), whose sum is σ = 815265998973824. Its totient is φ = 186860627930880.
The previous prime is 420112002051481. The next prime is 420112002051613. The reversal of 420112002051525 is 525150200211024.
It is not a de Polignac number, because 420112002051525 - 213 = 420112002043333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420112002051492 and 420112002051501.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 10813674322 + ... + 10813713171.
Almost surely, 2420112002051525 is an apocalyptic number.
It is an amenable number.
420112002051525 is a deficient number, since it is larger than the sum of its proper divisors (395153996922299).
420112002051525 is a wasteful number, since it uses less digits than its factorization.
420112002051525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21627387550 (or 21627387545 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 420112002051525 its reverse (525150200211024), we get a palindrome (945262202262549).
The spelling of 420112002051525 in words is "four hundred twenty trillion, one hundred twelve billion, two million, fifty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •