Base | Representation |
---|---|
bin | 10000101000110001111… |
… | …111110100011110011011 |
3 | 11001022001112212111000221 |
4 | 100220301333310132123 |
5 | 122212434312124311 |
6 | 2233120321140511 |
7 | 145413020424634 |
oct | 20506177643633 |
9 | 4038045774027 |
10 | 1143300114331 |
11 | 400964121851 |
12 | 1656b4a8a737 |
13 | 83a7477cbbb |
14 | 3d49c08088b |
15 | 1eb1705e671 |
hex | 10a31ff479b |
1143300114331 has 2 divisors, whose sum is σ = 1143300114332. Its totient is φ = 1143300114330.
The previous prime is 1143300114287. The next prime is 1143300114461. The reversal of 1143300114331 is 1334110033411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1143300114331 - 225 = 1143266559899 is a prime.
It is a super-2 number, since 2×11433001143312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1143300114296 and 1143300114305.
It is not a weakly prime, because it can be changed into another prime (1143300114631) 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 as a sum of consecutive naturals, namely, 571650057165 + 571650057166.
It is an arithmetic number, because the mean of its divisors is an integer number (571650057166).
Almost surely, 21143300114331 is an apocalyptic number.
1143300114331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1143300114331 is an equidigital number, since it uses as much as digits as its factorization.
1143300114331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 1143300114331 its reverse (1334110033411), we get a palindrome (2477410147742).
The spelling of 1143300114331 in words is "one trillion, one hundred forty-three billion, three hundred million, one hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •