Base | Representation |
---|---|
bin | 10001000101100… |
… | …00101100010110 |
3 | 100222200220220010 |
4 | 20202300230112 |
5 | 243143030240 |
6 | 22120021050 |
7 | 3360166632 |
oct | 1042605426 |
9 | 328626803 |
10 | 143330070 |
11 | 739a7004 |
12 | 40001786 |
13 | 23904cc0 |
14 | 1506ddc2 |
15 | c8b3280 |
hex | 88b0b16 |
143330070 has 64 divisors (see below), whose sum is σ = 372314880. Its totient is φ = 35104128.
The previous prime is 143330063. The next prime is 143330071. The reversal of 143330070 is 70033341.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143330071) 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 31 ways as a sum of consecutive naturals, for example, 87721 + ... + 89339.
It is an arithmetic number, because the mean of its divisors is an integer number (5817420).
Almost surely, 2143330070 is an apocalyptic number.
143330070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 143330070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186157440).
143330070 is an abundant number, since it is smaller than the sum of its proper divisors (228984810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143330070 is a wasteful number, since it uses less digits than its factorization.
143330070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869.
The product of its (nonzero) digits is 756, while the sum is 21.
The square root of 143330070 is about 11972.0537085331. The cubic root of 143330070 is about 523.3341848427.
The spelling of 143330070 in words is "one hundred forty-three million, three hundred thirty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •