Base | Representation |
---|---|
bin | 1110001001101010111… |
… | …0011110001100010010 |
3 | 212020112000221221201121 |
4 | 3202122232132030102 |
5 | 12440344143322010 |
6 | 303403545352454 |
7 | 23364410155561 |
oct | 3423256361422 |
9 | 766460857647 |
10 | 243114042130 |
11 | 941165a2183 |
12 | 3b14a49872a |
13 | 19c055a50cb |
14 | baa409dbd8 |
15 | 64cd52a3da |
hex | 389ab9e312 |
243114042130 has 8 divisors (see below), whose sum is σ = 437605275852. Its totient is φ = 97245616848.
The previous prime is 243114042113. The next prime is 243114042137. The reversal of 243114042130 is 31240411342.
243114042130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 235788907561 + 7325134569 = 485581^2 + 85587^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 243114042095 and 243114042104.
It is not an unprimeable number, because it can be changed into a prime (243114042137) 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, 12155702097 + ... + 12155702116.
Almost surely, 2243114042130 is an apocalyptic number.
243114042130 is a deficient number, since it is larger than the sum of its proper divisors (194491233722).
243114042130 is a wasteful number, since it uses less digits than its factorization.
243114042130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24311404220.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 243114042130 its reverse (31240411342), we get a palindrome (274354453472).
The spelling of 243114042130 in words is "two hundred forty-three billion, one hundred fourteen million, forty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •