Base | Representation |
---|---|
bin | 101111110001100000110110… |
… | …1001100001100010110110101 |
3 | 2001002212202222010101111211212 |
4 | 1133203001231030030112311 |
5 | 420034401443112403100 |
6 | 4045423021052411205 |
7 | 154340665554135662 |
oct | 13743015514142665 |
9 | 2032782863344755 |
10 | 420221432153525 |
11 | 1119939aa334002 |
12 | 3b16988b476b05 |
13 | 150629321542b2 |
14 | 75aab7c150a69 |
15 | 338adccc9b635 |
hex | 17e306d30c5b5 |
420221432153525 has 12 divisors (see below), whose sum is σ = 521080567173504. Its totient is φ = 336173280366000.
The previous prime is 420221432153431. The next prime is 420221432153543. The reversal of 420221432153525 is 525351234122024.
It is not a de Polignac number, because 420221432153525 - 218 = 420221431891381 is a prime.
It is a super-2 number, since 2×4202214321535252 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94415141 + ... + 98765690.
It is an arithmetic number, because the mean of its divisors is an integer number (43423380597792).
Almost surely, 2420221432153525 is an apocalyptic number.
It is an amenable number.
420221432153525 is a deficient number, since it is larger than the sum of its proper divisors (100859135019979).
420221432153525 is a wasteful number, since it uses less digits than its factorization.
420221432153525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193267852 (or 193267847 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 420221432153525 its reverse (525351234122024), we get a palindrome (945572666275549).
The spelling of 420221432153525 in words is "four hundred twenty trillion, two hundred twenty-one billion, four hundred thirty-two million, one hundred fifty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •