Base | Representation |
---|---|
bin | 1111110011001010… |
… | …0011111111000111 |
3 | 101221120101212100102 |
4 | 3330302203333013 |
5 | 32141211104111 |
6 | 1540501434315 |
7 | 210045603011 |
oct | 37462437707 |
9 | 11846355312 |
10 | 4241113031 |
11 | 1886aa7aa1 |
12 | 9a440b99b |
13 | 52787204c |
14 | 2c33991b1 |
15 | 19c50113b |
hex | fcca3fc7 |
4241113031 has 4 divisors (see below), whose sum is σ = 4241700600. Its totient is φ = 4240525464.
The previous prime is 4241113027. The next prime is 4241113039. The reversal of 4241113031 is 1303111424.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4241113031 - 22 = 4241113027 is a prime.
It is a super-2 number, since 2×42411130312 = 35974079483436013922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4241112994 and 4241113012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241113039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 282821 + ... + 297438.
It is an arithmetic number, because the mean of its divisors is an integer number (1060425150).
Almost surely, 24241113031 is an apocalyptic number.
4241113031 is a deficient number, since it is larger than the sum of its proper divisors (587569).
4241113031 is an equidigital number, since it uses as much as digits as its factorization.
4241113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587568.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 4241113031 is about 65123.8284424373. The cubic root of 4241113031 is about 1618.6760802329.
Adding to 4241113031 its reverse (1303111424), we get a palindrome (5544224455).
The spelling of 4241113031 in words is "four billion, two hundred forty-one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •