Base | Representation |
---|---|
bin | 1110000110011000011… |
… | …1111001001111000101 |
3 | 212011020112022212210112 |
4 | 3201212013321033011 |
5 | 12432042231422203 |
6 | 303140222002405 |
7 | 23333502616454 |
oct | 3414607711705 |
9 | 764215285715 |
10 | 242231514053 |
11 | 93803413831 |
12 | 3ab42a16405 |
13 | 19ac47b8249 |
14 | ba1cbb0b9b |
15 | 647ad006d8 |
hex | 38661f93c5 |
242231514053 has 4 divisors (see below), whose sum is σ = 242963331648. Its totient is φ = 241499696460.
The previous prime is 242231514029. The next prime is 242231514059. The reversal of 242231514053 is 350415132242.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 242231514053 - 222 = 242227319749 is a prime.
It is a super-2 number, since 2×2422315140532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242231514059) 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, 365908301 + ... + 365908962.
It is an arithmetic number, because the mean of its divisors is an integer number (60740832912).
Almost surely, 2242231514053 is an apocalyptic number.
It is an amenable number.
242231514053 is a deficient number, since it is larger than the sum of its proper divisors (731817595).
242231514053 is an equidigital number, since it uses as much as digits as its factorization.
242231514053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 731817594.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 242231514053 its reverse (350415132242), we get a palindrome (592646646295).
The spelling of 242231514053 in words is "two hundred forty-two billion, two hundred thirty-one million, five hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •