Base | Representation |
---|---|
bin | 1000010110011000010… |
… | …1001010111001001101 |
3 | 111201021000222212110111 |
4 | 2011212011022321031 |
5 | 4322234304132031 |
6 | 145522021240021 |
7 | 13235511401164 |
oct | 2054605127115 |
9 | 451230885414 |
10 | 143446552141 |
11 | 55920925842 |
12 | 23973b63011 |
13 | 106b0936a69 |
14 | 6d2b2763db |
15 | 3ae85c21b1 |
hex | 216614ae4d |
143446552141 has 2 divisors, whose sum is σ = 143446552142. Its totient is φ = 143446552140.
The previous prime is 143446552103. The next prime is 143446552159. The reversal of 143446552141 is 141255644341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121469675625 + 21976876516 = 348525^2 + 148246^2 .
It is a cyclic number.
It is not a de Polignac number, because 143446552141 - 233 = 134856617549 is a prime.
It is a super-2 number, since 2×1434465521412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143446552094 and 143446552103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143446552841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71723276070 + 71723276071.
It is an arithmetic number, because the mean of its divisors is an integer number (71723276071).
Almost surely, 2143446552141 is an apocalyptic number.
It is an amenable number.
143446552141 is a deficient number, since it is larger than the sum of its proper divisors (1).
143446552141 is an equidigital number, since it uses as much as digits as its factorization.
143446552141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 230400, while the sum is 40.
The spelling of 143446552141 in words is "one hundred forty-three billion, four hundred forty-six million, five hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •