Base | Representation |
---|---|
bin | 1100001110010110110… |
… | …00110101101110111111 |
3 | 1111011011012110202120210 |
4 | 12013023120311232333 |
5 | 23340202133122421 |
6 | 520542330243503 |
7 | 42226406030310 |
oct | 6071330655677 |
9 | 1434135422523 |
10 | 420024114111 |
11 | 152149731738 |
12 | 694a1286593 |
13 | 307ba009b84 |
14 | 16487764607 |
15 | add4829576 |
hex | 61cb635bbf |
420024114111 has 8 divisors (see below), whose sum is σ = 640036745344. Its totient is φ = 240013779480.
The previous prime is 420024114091. The next prime is 420024114221. The reversal of 420024114111 is 111411420024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420024114111 - 26 = 420024114047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 20001148291 = 420024114111 / (4 + 2 + 0 + 0 + 2 + 4 + 1 + 1 + 4 + 1 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420024114311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10000574125 + ... + 10000574166.
It is an arithmetic number, because the mean of its divisors is an integer number (80004593168).
Almost surely, 2420024114111 is an apocalyptic number.
420024114111 is a deficient number, since it is larger than the sum of its proper divisors (220012631233).
420024114111 is a wasteful number, since it uses less digits than its factorization.
420024114111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20001148301.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 420024114111 its reverse (111411420024), we get a palindrome (531435534135).
The spelling of 420024114111 in words is "four hundred twenty billion, twenty-four million, one hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •