Base | Representation |
---|---|
bin | 10001000110101… |
… | …01101000110101 |
3 | 100222222121110211 |
4 | 20203111220311 |
5 | 243212401042 |
6 | 22123145421 |
7 | 3361400053 |
oct | 1043255065 |
9 | 328877424 |
10 | 143481397 |
11 | 73a9a774 |
12 | 40075271 |
13 | 23958b47 |
14 | 150ad1d3 |
15 | c8e3017 |
hex | 88d5a35 |
143481397 has 4 divisors (see below), whose sum is σ = 143534476. Its totient is φ = 143428320.
The previous prime is 143481367. The next prime is 143481419. The reversal of 143481397 is 793184341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 56040196 + 87441201 = 7486^2 + 9351^2 .
It is a cyclic number.
It is not a de Polignac number, because 143481397 - 27 = 143481269 is a prime.
It is a super-2 number, since 2×1434813972 = 41173822570143218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143481367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22254 + ... + 27967.
It is an arithmetic number, because the mean of its divisors is an integer number (35883619).
Almost surely, 2143481397 is an apocalyptic number.
It is an amenable number.
143481397 is a deficient number, since it is larger than the sum of its proper divisors (53079).
143481397 is an equidigital number, since it uses as much as digits as its factorization.
143481397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53078.
The product of its digits is 72576, while the sum is 40.
The square root of 143481397 is about 11978.3720513265. The cubic root of 143481397 is about 523.5182977263.
The spelling of 143481397 in words is "one hundred forty-three million, four hundred eighty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •