Base | Representation |
---|---|
bin | 1110001001101100110… |
… | …1001110000100000011 |
3 | 212020112121010110111222 |
4 | 3202123031032010003 |
5 | 12440403224240111 |
6 | 303404434225255 |
7 | 23364535526360 |
oct | 3423315160403 |
9 | 766477113458 |
10 | 243122102531 |
11 | 941200a8070 |
12 | 3b15112522b |
13 | 19c07167b89 |
14 | baa519b467 |
15 | 64ce0bd7db |
hex | 389b34e103 |
243122102531 has 16 divisors (see below), whose sum is σ = 316292110848. Its totient is φ = 181209019200.
The previous prime is 243122102521. The next prime is 243122102609. The reversal of 243122102531 is 135201221342.
It is not a de Polignac number, because 243122102531 - 26 = 243122102467 is a prime.
It is a super-2 number, since 2×2431221025312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 243122102531.
It is not an unprimeable number, because it can be changed into a prime (243122102501) 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 15 ways as a sum of consecutive naturals, for example, 68638010 + ... + 68641551.
It is an arithmetic number, because the mean of its divisors is an integer number (19768256928).
Almost surely, 2243122102531 is an apocalyptic number.
243122102531 is a deficient number, since it is larger than the sum of its proper divisors (73170008317).
243122102531 is a wasteful number, since it uses less digits than its factorization.
243122102531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137279602.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 243122102531 its reverse (135201221342), we get a palindrome (378323323873).
The spelling of 243122102531 in words is "two hundred forty-three billion, one hundred twenty-two million, one hundred two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •