Base | Representation |
---|---|
bin | 1000010101110101011… |
… | …0000111101000111100 |
3 | 111200212211020021011010 |
4 | 2011131112013220330 |
5 | 4321434300002231 |
6 | 145455304155220 |
7 | 13232051622324 |
oct | 2053526075074 |
9 | 450784207133 |
10 | 143300000316 |
11 | 55856129230 |
12 | 23932a68b10 |
13 | 106894744c5 |
14 | 6d15a08284 |
15 | 3ada7c4546 |
hex | 215d587a3c |
143300000316 has 48 divisors (see below), whose sum is σ = 365017605120. Its totient is φ = 43394008320.
The previous prime is 143300000287. The next prime is 143300000353. The reversal of 143300000316 is 613000003341.
143300000316 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 143300000292 and 143300000301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187261 + ... + 567156.
It is an arithmetic number, because the mean of its divisors is an integer number (7604533440).
Almost surely, 2143300000316 is an apocalyptic number.
It is an amenable number.
143300000316 is an abundant number, since it is smaller than the sum of its proper divisors (221717604804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143300000316 is a wasteful number, since it uses less digits than its factorization.
143300000316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755874 (or 755872 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 143300000316 its reverse (613000003341), we get a palindrome (756300003657).
The spelling of 143300000316 in words is "one hundred forty-three billion, three hundred million, three hundred sixteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •