Base | Representation |
---|---|
bin | 1000000000101111… |
… | …00011000100010001 |
3 | 102002202100120012102 |
4 | 10000113203010101 |
5 | 32302042441431 |
6 | 1550444210145 |
7 | 211405042316 |
oct | 40027430421 |
9 | 12082316172 |
10 | 4301140241 |
11 | 1907977362 |
12 | a00539955 |
13 | 53712b4c8 |
14 | 2cb342d0d |
15 | 1a290bdcb |
hex | 1005e3111 |
4301140241 has 4 divisors (see below), whose sum is σ = 4365336432. Its totient is φ = 4236944052.
The previous prime is 4301140223. The next prime is 4301140243. The reversal of 4301140241 is 1420411034.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4301140241 - 26 = 4301140177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4301140243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32097995 + ... + 32098128.
It is an arithmetic number, because the mean of its divisors is an integer number (1091334108).
Almost surely, 24301140241 is an apocalyptic number.
It is an amenable number.
4301140241 is a deficient number, since it is larger than the sum of its proper divisors (64196191).
4301140241 is an equidigital number, since it uses as much as digits as its factorization.
4301140241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64196190.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 4301140241 is about 65583.0789228441. The cubic root of 4301140241 is about 1626.2770541619.
Adding to 4301140241 its reverse (1420411034), we get a palindrome (5721551275).
The spelling of 4301140241 in words is "four billion, three hundred one million, one hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •