Base | Representation |
---|---|
bin | 1000010101001010011… |
… | …1011111000000100110 |
3 | 111200102021112110101221 |
4 | 2011102213133000212 |
5 | 4321102210044420 |
6 | 145425354210554 |
7 | 13224434645200 |
oct | 2052247370046 |
9 | 450367473357 |
10 | 143120003110 |
11 | 55773568707 |
12 | 238a2723a5a |
13 | 1065b0a1996 |
14 | 6cd9b51770 |
15 | 3ac9abbcaa |
hex | 21529df026 |
143120003110 has 48 divisors (see below), whose sum is σ = 301350112560. Its totient is φ = 48795552960.
The previous prime is 143120003063. The next prime is 143120003123. The reversal of 143120003110 is 11300021341.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 728161 + ... + 903580.
It is an arithmetic number, because the mean of its divisors is an integer number (6278127345).
Almost surely, 2143120003110 is an apocalyptic number.
143120003110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143120003110 is an abundant number, since it is smaller than the sum of its proper divisors (158230109450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143120003110 is a wasteful number, since it uses less digits than its factorization.
143120003110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631941 (or 1631934 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 143120003110 its reverse (11300021341), we get a palindrome (154420024451).
The spelling of 143120003110 in words is "one hundred forty-three billion, one hundred twenty million, three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •