Base | Representation |
---|---|
bin | 10000101110010011100… |
… | …101100011100100100101 |
3 | 11001212100222102222110201 |
4 | 100232103211203210211 |
5 | 122312111441120223 |
6 | 2235541113550501 |
7 | 146013022625632 |
oct | 20562345434445 |
9 | 4055328388421 |
10 | 1149232363813 |
11 | 403428788676 |
12 | 16688b715431 |
13 | 844ab7b6cb1 |
14 | 3d8a1c95189 |
15 | 1ed62c62ead |
hex | 10b93963925 |
1149232363813 has 2 divisors, whose sum is σ = 1149232363814. Its totient is φ = 1149232363812.
The previous prime is 1149232363793. The next prime is 1149232363859. The reversal of 1149232363813 is 3183632329411.
It is an a-pointer prime, because the next prime (1149232363859) can be obtained adding 1149232363813 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1142540796609 + 6691567204 = 1068897^2 + 81802^2 .
It is a cyclic number.
It is not a de Polignac number, because 1149232363813 - 233 = 1140642429221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1149232763813) 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 as a sum of consecutive naturals, namely, 574616181906 + 574616181907.
It is an arithmetic number, because the mean of its divisors is an integer number (574616181907).
Almost surely, 21149232363813 is an apocalyptic number.
It is an amenable number.
1149232363813 is a deficient number, since it is larger than the sum of its proper divisors (1).
1149232363813 is an equidigital number, since it uses as much as digits as its factorization.
1149232363813 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 559872, while the sum is 46.
The spelling of 1149232363813 in words is "one trillion, one hundred forty-nine billion, two hundred thirty-two million, three hundred sixty-three thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •