Base | Representation |
---|---|
bin | 1111110011011001… |
… | …1001111000100111 |
3 | 101221122022000222010 |
4 | 3330312121320213 |
5 | 32141440321411 |
6 | 1540535205303 |
7 | 210060266316 |
oct | 37466317047 |
9 | 11848260863 |
10 | 4242120231 |
11 | 1887625798 |
12 | 9a4816833 |
13 | 527b3561b |
14 | 2c357c27d |
15 | 19c64e7a6 |
hex | fcd99e27 |
4242120231 has 8 divisors (see below), whose sum is σ = 5706215280. Its totient is φ = 2803052672.
The previous prime is 4242120217. The next prime is 4242120247. The reversal of 4242120231 is 1320212424.
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 4242120231 - 29 = 4242119719 is a prime.
It is a super-2 number, since 2×42421202312 = 35991168108518986722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4242120198 and 4242120207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4242120431) 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, 6256476 + ... + 6257153.
It is an arithmetic number, because the mean of its divisors is an integer number (713276910).
Almost surely, 24242120231 is an apocalyptic number.
4242120231 is a deficient number, since it is larger than the sum of its proper divisors (1464095049).
4242120231 is a wasteful number, since it uses less digits than its factorization.
4242120231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12513745.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 4242120231 is about 65131.5609439848. The cubic root of 4242120231 is about 1618.8042070944.
Adding to 4242120231 its reverse (1320212424), we get a palindrome (5562332655).
The spelling of 4242120231 in words is "four billion, two hundred forty-two million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •