Base | Representation |
---|---|
bin | 10001000011110… |
… | …11101110010110 |
3 | 100222021220021120 |
4 | 20201323232112 |
5 | 243114104420 |
6 | 22111224410 |
7 | 3355304250 |
oct | 1041735626 |
9 | 328256246 |
10 | 143113110 |
11 | 73868aa8 |
12 | 3bb18106 |
13 | 2385a31a |
14 | 15014cd0 |
15 | c86dd40 |
hex | 887bb96 |
143113110 has 64 divisors (see below), whose sum is σ = 393513984. Its totient is φ = 32630400.
The previous prime is 143113109. The next prime is 143113127. The reversal of 143113110 is 11311341.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 143113110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 138295 + ... + 139325.
It is an arithmetic number, because the mean of its divisors is an integer number (6148656).
Almost surely, 2143113110 is an apocalyptic number.
143113110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143113110 is an abundant number, since it is smaller than the sum of its proper divisors (250400874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143113110 is a wasteful number, since it uses less digits than its factorization.
143113110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 143113110 is about 11962.9891749512. The cubic root of 143113110 is about 523.0699929600.
Adding to 143113110 its reverse (11311341), we get a palindrome (154424451).
It can be divided in two parts, 1431 and 13110, that added together give a palindrome (14541).
The spelling of 143113110 in words is "one hundred forty-three million, one hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •