Base | Representation |
---|---|
bin | 1100010101111101111… |
… | …00000001100110001111 |
3 | 1111112200222011111100210 |
4 | 12022332330001212033 |
5 | 23422034202414411 |
6 | 522500013253503 |
7 | 42432563141613 |
oct | 6127674014617 |
9 | 1445628144323 |
10 | 424110201231 |
11 | 153956174442 |
12 | 6a241794293 |
13 | 30cbb7104c2 |
14 | 167542c7343 |
15 | b073406ca6 |
hex | 62bef0198f |
424110201231 has 8 divisors (see below), whose sum is σ = 565515672624. Its totient is φ = 282722432000.
The previous prime is 424110201187. The next prime is 424110201233. The reversal of 424110201231 is 132102011424.
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 424110201231 - 26 = 424110201167 is a prime.
It is a super-2 number, since 2×4241102012312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 424110201198 and 424110201207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424110201233) 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, 4369536 + ... + 4465541.
It is an arithmetic number, because the mean of its divisors is an integer number (70689459078).
Almost surely, 2424110201231 is an apocalyptic number.
424110201231 is a deficient number, since it is larger than the sum of its proper divisors (141405471393).
424110201231 is a wasteful number, since it uses less digits than its factorization.
424110201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8851081.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 424110201231 its reverse (132102011424), we get a palindrome (556212212655).
The spelling of 424110201231 in words is "four hundred twenty-four billion, one hundred ten million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •