Base | Representation |
---|---|
bin | 1110000010101100011… |
… | …1000001100100100111 |
3 | 212001200112022102020022 |
4 | 3200223013001210213 |
5 | 12423030301232221 |
6 | 302454053025355 |
7 | 23300121216110 |
oct | 3405307014447 |
9 | 761615272208 |
10 | 241241430311 |
11 | 93345553202 |
12 | 3a90732525b |
13 | 1999764078b |
14 | b9674c5207 |
15 | 641de2c4ab |
hex | 382b1c1927 |
241241430311 has 4 divisors (see below), whose sum is σ = 275704491792. Its totient is φ = 206778368832.
The previous prime is 241241430301. The next prime is 241241430317. The reversal of 241241430311 is 113034142142.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113034142142 = 2 ⋅56517071071.
It is a de Polignac number, because none of the positive numbers 2k-241241430311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241241430317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17231530730 + ... + 17231530743.
It is an arithmetic number, because the mean of its divisors is an integer number (68926122948).
Almost surely, 2241241430311 is an apocalyptic number.
241241430311 is a deficient number, since it is larger than the sum of its proper divisors (34463061481).
241241430311 is an equidigital number, since it uses as much as digits as its factorization.
241241430311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34463061480.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 241241430311 its reverse (113034142142), we get a palindrome (354275572453).
The spelling of 241241430311 in words is "two hundred forty-one billion, two hundred forty-one million, four hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •