Base | Representation |
---|---|
bin | 101111110011000100000001… |
… | …1010000101100010111001101 |
3 | 2001010122010200110012101011220 |
4 | 1133212020003100230113031 |
5 | 420101344124222004401 |
6 | 4050104522023433553 |
7 | 154362245311131522 |
oct | 13746100320542715 |
9 | 2033563613171156 |
10 | 420434403313101 |
11 | 111a66257a713a1 |
12 | 3b1a3006bb58b9 |
13 | 15079a42887c08 |
14 | 75b71c2c11149 |
15 | 33916e4d77336 |
hex | 17e620342c5cd |
420434403313101 has 32 divisors (see below), whose sum is σ = 586737372211200. Its totient is φ = 267285185644224.
The previous prime is 420434403313031. The next prime is 420434403313117. The reversal of 420434403313101 is 101313304434024.
It is not a de Polignac number, because 420434403313101 - 247 = 279696914957773 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420434403313181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128103856 + ... + 131344838.
It is an arithmetic number, because the mean of its divisors is an integer number (18335542881600).
Almost surely, 2420434403313101 is an apocalyptic number.
It is an amenable number.
420434403313101 is a deficient number, since it is larger than the sum of its proper divisors (166302968898099).
420434403313101 is a wasteful number, since it uses less digits than its factorization.
420434403313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3246745.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 420434403313101 its reverse (101313304434024), we get a palindrome (521747707747125).
The spelling of 420434403313101 in words is "four hundred twenty trillion, four hundred thirty-four billion, four hundred three million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •