Base | Representation |
---|---|
bin | 1000010101011101101… |
… | …0110011101100100010 |
3 | 111200121220010110222112 |
4 | 2011113122303230202 |
5 | 4321233321103200 |
6 | 145441353035322 |
7 | 13226433504443 |
oct | 2052732635442 |
9 | 450556113875 |
10 | 143200566050 |
11 | 55804a93853 |
12 | 239056b5b42 |
13 | 1067199b369 |
14 | 6d067232ca |
15 | 3ad1bd2535 |
hex | 21576b3b22 |
143200566050 has 12 divisors (see below), whose sum is σ = 266353052946. Its totient is φ = 57280226400.
The previous prime is 143200566031. The next prime is 143200566071. The reversal of 143200566050 is 50665002341.
143200566050 is digitally balanced in base 2, 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 3 ways, for example, as 132566625409 + 10633940641 = 364097^2 + 103121^2 .
It is a junction number, because it is equal to n+sod(n) for n = 143200565998 and 143200566016.
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 5 ways as a sum of consecutive naturals, for example, 1432005611 + ... + 1432005710.
Almost surely, 2143200566050 is an apocalyptic number.
143200566050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143200566050 is a deficient number, since it is larger than the sum of its proper divisors (123152486896).
143200566050 is a wasteful number, since it uses less digits than its factorization.
143200566050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2864011333 (or 2864011328 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 143200566050 its reverse (50665002341), we get a palindrome (193865568391).
The spelling of 143200566050 in words is "one hundred forty-three billion, two hundred million, five hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •