Base | Representation |
---|---|
bin | 100000100100001011101111… |
… | …010101001010100000101001 |
3 | 200210010002011110011100121112 |
4 | 200210023233111022200221 |
5 | 122233040220124130423 |
6 | 1224340110031320105 |
7 | 42111410051404346 |
oct | 4044135725124051 |
9 | 623102143140545 |
10 | 143223994755113 |
11 | 416a9a56219848 |
12 | 1409192a080035 |
13 | 61bbc707406cc |
14 | 2752114d377cd |
15 | 11858b89aba78 |
hex | 8242ef54a829 |
143223994755113 has 2 divisors, whose sum is σ = 143223994755114. Its totient is φ = 143223994755112.
The previous prime is 143223994755047. The next prime is 143223994755217. The reversal of 143223994755113 is 311557499322341.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117966816730009 + 25257178025104 = 10861253^2 + 5025652^2 .
It is a cyclic number.
It is not a de Polignac number, because 143223994755113 - 214 = 143223994738729 is a prime.
It is a super-2 number, since 2×1432239947551132 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (143223994755613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71611997377556 + 71611997377557.
It is an arithmetic number, because the mean of its divisors is an integer number (71611997377557).
Almost surely, 2143223994755113 is an apocalyptic number.
It is an amenable number.
143223994755113 is a deficient number, since it is larger than the sum of its proper divisors (1).
143223994755113 is an equidigital number, since it uses as much as digits as its factorization.
143223994755113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 24494400, while the sum is 59.
The spelling of 143223994755113 in words is "one hundred forty-three trillion, two hundred twenty-three billion, nine hundred ninety-four million, seven hundred fifty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •