Base | Representation |
---|---|
bin | 1110000011110001010… |
… | …0110000010111100111 |
3 | 212002102122202121010100 |
4 | 3200330110300113213 |
5 | 12424123220230120 |
6 | 302542451155143 |
7 | 23310226121211 |
oct | 3407424602747 |
9 | 762378677110 |
10 | 241530242535 |
11 | 9348358609a |
12 | 3a987ba5ab3 |
13 | 19a1242219a |
14 | b9939c55b1 |
15 | 643947b490 |
hex | 383c5305e7 |
241530242535 has 24 divisors (see below), whose sum is σ = 419140996560. Its totient is φ = 128665798272.
The previous prime is 241530242519. The next prime is 241530242543. The reversal of 241530242535 is 535242035142.
241530242535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 241530242535 - 24 = 241530242519 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241530242535.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3092905 + ... + 3170034.
It is an arithmetic number, because the mean of its divisors is an integer number (17464208190).
Almost surely, 2241530242535 is an apocalyptic number.
241530242535 is a deficient number, since it is larger than the sum of its proper divisors (177610754025).
241530242535 is a wasteful number, since it uses less digits than its factorization.
241530242535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6263807 (or 6263804 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
Adding to 241530242535 its reverse (535242035142), we get a palindrome (776772277677).
The spelling of 241530242535 in words is "two hundred forty-one billion, five hundred thirty million, two hundred forty-two thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •