Base | Representation |
---|---|
bin | 1110000110110111010… |
… | …0000001110011100011 |
3 | 212011120112002021011211 |
4 | 3201231310001303203 |
5 | 12432323243232003 |
6 | 303201111050551 |
7 | 23336630314663 |
oct | 3415564016343 |
9 | 764515067154 |
10 | 242360524003 |
11 | 9386a219924 |
12 | 3ab7a070a57 |
13 | 19b154481b0 |
14 | ba31d941a3 |
15 | 64872d596d |
hex | 386dd01ce3 |
242360524003 has 4 divisors (see below), whose sum is σ = 261003641248. Its totient is φ = 223717406760.
The previous prime is 242360523983. The next prime is 242360524009. The reversal of 242360524003 is 300425063242.
242360524003 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 is a cyclic number.
It is not a de Polignac number, because 242360524003 - 29 = 242360523491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (242360524009) 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 in 3 ways as a sum of consecutive naturals, for example, 9321558603 + ... + 9321558628.
It is an arithmetic number, because the mean of its divisors is an integer number (65250910312).
Almost surely, 2242360524003 is an apocalyptic number.
242360524003 is a deficient number, since it is larger than the sum of its proper divisors (18643117245).
242360524003 is a wasteful number, since it uses less digits than its factorization.
242360524003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18643117244.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 242360524003 its reverse (300425063242), we get a palindrome (542785587245).
The spelling of 242360524003 in words is "two hundred forty-two billion, three hundred sixty million, five hundred twenty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •