Base | Representation |
---|---|
bin | 1110000110000001001… |
… | …1011010000111110001 |
3 | 212010222201121000000121 |
4 | 3201200103122013301 |
5 | 12431342232302131 |
6 | 303122413050241 |
7 | 23331205633231 |
oct | 3414023320761 |
9 | 763881530017 |
10 | 242133869041 |
11 | 93763290679 |
12 | 3ab16186981 |
13 | 19aaa4ba62c |
14 | ba0dc33cc1 |
15 | 6472463911 |
hex | 38604da1f1 |
242133869041 has 9 divisors (see below), whose sum is σ = 243582736971. Its totient is φ = 240693577224.
The previous prime is 242133868973. The next prime is 242133869077. The reversal of 242133869041 is 140968331242.
The square root of 242133869041 is 492071.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 28856156641 + 213277712400 = 169871^2 + 461820^2 .
It is not a de Polignac number, because 242133869041 - 229 = 241596998129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (242133869441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 88079335 + ... + 88082083.
Almost surely, 2242133869041 is an apocalyptic number.
242133869041 is the 492071-st square number.
242133869041 is the 246036-th centered octagonal number.
It is an amenable number.
242133869041 is a deficient number, since it is larger than the sum of its proper divisors (1448867930).
242133869041 is an frugal number, since it uses more digits than its factorization.
242133869041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5856 (or 2928 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 242133869041 in words is "two hundred forty-two billion, one hundred thirty-three million, eight hundred sixty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •