Base | Representation |
---|---|
bin | 10001000011110… |
… | …11011100100010 |
3 | 100222021211201100 |
4 | 20201323130202 |
5 | 243114040340 |
6 | 22111215230 |
7 | 3355301031 |
oct | 1041733442 |
9 | 328254640 |
10 | 143111970 |
11 | 73868161 |
12 | 3bb17516 |
13 | 23859951 |
14 | 15014718 |
15 | c86d830 |
hex | 887b722 |
143111970 has 24 divisors (see below), whose sum is σ = 372091356. Its totient is φ = 38163168.
The previous prime is 143111959. The next prime is 143111989. The reversal of 143111970 is 79111341.
143111970 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 134165889 + 8946081 = 11583^2 + 2991^2 .
It is a Curzon number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 794977 + ... + 795156.
Almost surely, 2143111970 is an apocalyptic number.
143111970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143111970 is an abundant number, since it is smaller than the sum of its proper divisors (228979386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143111970 is a wasteful number, since it uses less digits than its factorization.
143111970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590146 (or 1590143 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 143111970 is about 11962.9415279019. The cubic root of 143111970 is about 523.0686040787.
The spelling of 143111970 in words is "one hundred forty-three million, one hundred eleven thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.297 sec. • engine limits •