Base | Representation |
---|---|
bin | 10001000101001… |
… | …11001001000000 |
3 | 100222121221020000 |
4 | 20202213021000 |
5 | 243140302234 |
6 | 22115120000 |
7 | 3356644566 |
oct | 1042471100 |
9 | 328557200 |
10 | 143290944 |
11 | 7397a675 |
12 | 3bba3000 |
13 | 238c0254 |
14 | 1505da36 |
15 | c8a6899 |
hex | 88a7240 |
143290944 has 140 divisors (see below), whose sum is σ = 430030128. Its totient is φ = 47174400.
The previous prime is 143290933. The next prime is 143290949. The reversal of 143290944 is 449092341.
It is a super-2 number, since 2×1432909442 = 41064589264822272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 143290899 and 143290908.
It is not an unprimeable number, because it can be changed into a prime (143290949) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 678999 + ... + 679209.
Almost surely, 2143290944 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143290944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215015064).
143290944 is an abundant number, since it is smaller than the sum of its proper divisors (286739184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143290944 is a wasteful number, since it uses less digits than its factorization.
143290944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366 (or 347 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 143290944 is about 11970.4195415198. The cubic root of 143290944 is about 523.2865608822.
The spelling of 143290944 in words is "one hundred forty-three million, two hundred ninety thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •