Base | Representation |
---|---|
bin | 1110000101100011111… |
… | …1010011000001111001 |
3 | 212010200011200120012102 |
4 | 3201120333103001321 |
5 | 12431114324002401 |
6 | 303102310553145 |
7 | 23325155614064 |
oct | 3413077230171 |
9 | 763604616172 |
10 | 242011156601 |
11 | 936aaa96a35 |
12 | 3aaa10687b5 |
13 | 19a8ac53c16 |
14 | b9db80d8db |
15 | 64667c456b |
hex | 3858fd3079 |
242011156601 has 4 divisors (see below), whose sum is σ = 242012419572. Its totient is φ = 242009893632.
The previous prime is 242011156591. The next prime is 242011156637. The reversal of 242011156601 is 106651110242.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 106651110242 = 2 ⋅53325555121.
It can be written as a sum of positive squares in 2 ways, for example, as 158272687225 + 83738469376 = 397835^2 + 289376^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242011156601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (242011156691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 278156 + ... + 749261.
It is an arithmetic number, because the mean of its divisors is an integer number (60503104893).
Almost surely, 2242011156601 is an apocalyptic number.
It is an amenable number.
242011156601 is a deficient number, since it is larger than the sum of its proper divisors (1262971).
242011156601 is a wasteful number, since it uses less digits than its factorization.
242011156601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1262970.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 242011156601 its reverse (106651110242), we get a palindrome (348662266843).
The spelling of 242011156601 in words is "two hundred forty-two billion, eleven million, one hundred fifty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •