Base | Representation |
---|---|
bin | 1000010101110101000… |
… | …1001011110010110101 |
3 | 111200212201210112112012 |
4 | 2011131101023302311 |
5 | 4321433432102423 |
6 | 145455220334005 |
7 | 13232034623516 |
oct | 2053521136265 |
9 | 450781715465 |
10 | 143298706613 |
11 | 55855425257 |
12 | 23932544305 |
13 | 106891106ba |
14 | 6d1578ca0d |
15 | 3ada61b078 |
hex | 215d44bcb5 |
143298706613 has 8 divisors (see below), whose sum is σ = 149947566336. Its totient is φ = 136776492000.
The previous prime is 143298706609. The next prime is 143298706697. The reversal of 143298706613 is 316607892341.
143298706613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143298706613 - 22 = 143298706609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143298706013) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 31658963 + ... + 31663488.
It is an arithmetic number, because the mean of its divisors is an integer number (18743445792).
Almost surely, 2143298706613 is an apocalyptic number.
It is an amenable number.
143298706613 is a deficient number, since it is larger than the sum of its proper divisors (6648859723).
143298706613 is an equidigital number, since it uses as much as digits as its factorization.
143298706613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63322555.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 143298706613 in words is "one hundred forty-three billion, two hundred ninety-eight million, seven hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •