Base | Representation |
---|---|
bin | 1000010101000001100… |
… | …1111011111100010001 |
3 | 111200022200201021121211 |
4 | 2011100121323330101 |
5 | 4321013210202134 |
6 | 145421551020121 |
7 | 13223504362462 |
oct | 2052031737421 |
9 | 450280637554 |
10 | 143082897169 |
11 | 55754624443 |
12 | 2389220a641 |
13 | 106534ac4c4 |
14 | 6cd4c52d69 |
15 | 3ac66dc764 |
hex | 215067bf11 |
143082897169 has 9 divisors (see below), whose sum is σ = 143684198139. Its totient is φ = 142484106840.
The previous prime is 143082897163. The next prime is 143082897233. The reversal of 143082897169 is 961798280341.
The square root of 143082897169 is 378263.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 135376164225 + 7706732944 = 367935^2 + 87788^2 .
It is not a de Polignac number, because 143082897169 - 227 = 142948679441 is a prime.
It is a super-2 number, since 2×1430828971692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143082897163) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 110830414 + ... + 110831704.
Almost surely, 2143082897169 is an apocalyptic number.
143082897169 is the 378263-rd square number.
143082897169 is the 189132-nd centered octagonal number.
It is an amenable number.
143082897169 is a deficient number, since it is larger than the sum of its proper divisors (601300970).
143082897169 is an frugal number, since it uses more digits than its factorization.
143082897169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3168 (or 1584 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 58.
The spelling of 143082897169 in words is "one hundred forty-three billion, eighty-two million, eight hundred ninety-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •