Base | Representation |
---|---|
bin | 1110001001110011110… |
… | …0010000110111111111 |
3 | 212020121121220101020121 |
4 | 3202130330100313333 |
5 | 12440433202241111 |
6 | 303411354155411 |
7 | 23365341125620 |
oct | 3423474206777 |
9 | 766547811217 |
10 | 243151212031 |
11 | 9413557a502 |
12 | 3b15aa22b67 |
13 | 19c101ba730 |
14 | baa8db7a47 |
15 | 64d191d871 |
hex | 389cf10dff |
243151212031 has 16 divisors (see below), whose sum is σ = 300504812608. Its totient is φ = 191585088000.
The previous prime is 243151211999. The next prime is 243151212049. The reversal of 243151212031 is 130212151342.
It is a cyclic number.
It is not a de Polignac number, because 243151212031 - 25 = 243151211999 is a prime.
It is a super-2 number, since 2×2431512120312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 243151211987 and 243151212005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243151212131) 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 15 ways as a sum of consecutive naturals, for example, 5521620 + ... + 5565481.
It is an arithmetic number, because the mean of its divisors is an integer number (18781550788).
Almost surely, 2243151212031 is an apocalyptic number.
243151212031 is a deficient number, since it is larger than the sum of its proper divisors (57353600577).
243151212031 is a wasteful number, since it uses less digits than its factorization.
243151212031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11087362.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 243151212031 its reverse (130212151342), we get a palindrome (373363363373).
The spelling of 243151212031 in words is "two hundred forty-three billion, one hundred fifty-one million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •