Base | Representation |
---|---|
bin | 1110000111000000111… |
… | …1010010011011110010 |
3 | 212011200100200001200012 |
4 | 3201300033102123302 |
5 | 12432414203140214 |
6 | 303205123254522 |
7 | 23340633261065 |
oct | 3416017223362 |
9 | 764610601605 |
10 | 242401224434 |
11 | 93890198746 |
12 | 3ab8b81a442 |
13 | 19b209c87a5 |
14 | ba3754a8dc |
15 | 648ab7503e |
hex | 38703d26f2 |
242401224434 has 4 divisors (see below), whose sum is σ = 363601836654. Its totient is φ = 121200612216.
The previous prime is 242401224389. The next prime is 242401224437. The reversal of 242401224434 is 434422104242.
242401224434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 197691390625 + 44709833809 = 444625^2 + 211447^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 242401224434.
It is not an unprimeable number, because it can be changed into a prime (242401224437) by changing a digit.
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 as a sum of consecutive naturals, namely, 60600306107 + ... + 60600306110.
Almost surely, 2242401224434 is an apocalyptic number.
242401224434 is a deficient number, since it is larger than the sum of its proper divisors (121200612220).
242401224434 is a wasteful number, since it uses less digits than its factorization.
242401224434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121200612219.
The product of its (nonzero) digits is 49152, while the sum is 32.
Adding to 242401224434 its reverse (434422104242), we get a palindrome (676823328676).
The spelling of 242401224434 in words is "two hundred forty-two billion, four hundred one million, two hundred twenty-four thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •