Base | Representation |
---|---|
bin | 10001000011000… |
… | …00011100111001 |
3 | 100222002020001012 |
4 | 20201200130321 |
5 | 243102021101 |
6 | 22105003305 |
7 | 3354330464 |
oct | 1041403471 |
9 | 328066035 |
10 | 143001401 |
11 | 737a2084 |
12 | 3ba83535 |
13 | 2381b51a |
14 | 14dc62db |
15 | c84abbb |
hex | 8860739 |
143001401 has 8 divisors (see below), whose sum is σ = 146296704. Its totient is φ = 139716720.
The previous prime is 143001371. The next prime is 143001431. The reversal of 143001401 is 104100341.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (143001371) and next prime (143001431).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143001401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143001431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28766 + ... + 33368.
It is an arithmetic number, because the mean of its divisors is an integer number (18287088).
Almost surely, 2143001401 is an apocalyptic number.
It is an amenable number.
143001401 is a deficient number, since it is larger than the sum of its proper divisors (3295303).
143001401 is an equidigital number, since it uses as much as digits as its factorization.
143001401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5311.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 143001401 is about 11958.3193217107. The cubic root of 143001401 is about 522.9338609275.
Adding to 143001401 its reverse (104100341), we get a palindrome (247101742).
The spelling of 143001401 in words is "one hundred forty-three million, one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •