Base | Representation |
---|---|
bin | 1110000101111001110… |
… | …1110001010110110111 |
3 | 212010220120120021111012 |
4 | 3201132131301112313 |
5 | 12431311333444343 |
6 | 303115352102435 |
7 | 23330352545114 |
oct | 3413635612667 |
9 | 763816507435 |
10 | 242103031223 |
11 | 93747938779 |
12 | 3ab07994a1b |
13 | 19aa3cb11c1 |
14 | ba09ac790b |
15 | 646e8c1718 |
hex | 385e7715b7 |
242103031223 has 8 divisors (see below), whose sum is σ = 250460435280. Its totient is φ = 233746228800.
The previous prime is 242103031207. The next prime is 242103031271. The reversal of 242103031223 is 322130301242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 242103031223 - 24 = 242103031207 is a prime.
It is a super-2 number, since 2×2421030312232 (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 (242103831223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 762248 + ... + 1032098.
It is an arithmetic number, because the mean of its divisors is an integer number (31307554410).
Almost surely, 2242103031223 is an apocalyptic number.
242103031223 is a deficient number, since it is larger than the sum of its proper divisors (8357404057).
242103031223 is a wasteful number, since it uses less digits than its factorization.
242103031223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300817.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 242103031223 its reverse (322130301242), we get a palindrome (564233332465).
The spelling of 242103031223 in words is "two hundred forty-two billion, one hundred three million, thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •