Base | Representation |
---|---|
bin | 100000100010101110111001… |
… | …000100110100100010010011 |
3 | 200202202112211120100221010122 |
4 | 200202232321010310202103 |
5 | 122224422031331101311 |
6 | 1224222221300220455 |
7 | 42101250404205245 |
oct | 4042567104644223 |
9 | 622675746327118 |
10 | 143124300253331 |
11 | 41670747283011 |
12 | 1407654669a72b |
13 | 61b2743305557 |
14 | 274b3786bc095 |
15 | 1182ed14ba0db |
hex | 822bb9134893 |
143124300253331 has 2 divisors, whose sum is σ = 143124300253332. Its totient is φ = 143124300253330.
The previous prime is 143124300253289. The next prime is 143124300253343. The reversal of 143124300253331 is 133352003421341.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143124300253331 is a prime.
It is a super-2 number, since 2×1431243002533312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143124300253291 and 143124300253300.
It is not a weakly prime, because it can be changed into another prime (143124300253351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71562150126665 + 71562150126666.
It is an arithmetic number, because the mean of its divisors is an integer number (71562150126666).
Almost surely, 2143124300253331 is an apocalyptic number.
143124300253331 is a deficient number, since it is larger than the sum of its proper divisors (1).
143124300253331 is an equidigital number, since it uses as much as digits as its factorization.
143124300253331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 143124300253331 its reverse (133352003421341), we get a palindrome (276476303674672).
The spelling of 143124300253331 in words is "one hundred forty-three trillion, one hundred twenty-four billion, three hundred million, two hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •