Base | Representation |
---|---|
bin | 1000010101001101010… |
… | …0001111110010011101 |
3 | 111200110002121121121112 |
4 | 2011103110033302131 |
5 | 4321113211042440 |
6 | 145430453511405 |
7 | 13224636456410 |
oct | 2052324176235 |
9 | 450402547545 |
10 | 143131737245 |
11 | 5577a152742 |
12 | 238a6642565 |
13 | 1066064c963 |
14 | 6cdb527b77 |
15 | 3acab38965 |
hex | 215350fc9d |
143131737245 has 8 divisors (see below), whose sum is σ = 196294953984. Its totient is φ = 98147476944.
The previous prime is 143131737233. The next prime is 143131737313. The reversal of 143131737245 is 542737131341.
143131737245 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 143131737245 - 28 = 143131736989 is a prime.
It is a Duffinian number.
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 7 ways as a sum of consecutive naturals, for example, 2044739069 + ... + 2044739138.
It is an arithmetic number, because the mean of its divisors is an integer number (24536869248).
Almost surely, 2143131737245 is an apocalyptic number.
It is an amenable number.
143131737245 is a deficient number, since it is larger than the sum of its proper divisors (53163216739).
143131737245 is an equidigital number, since it uses as much as digits as its factorization.
143131737245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4089478219.
The product of its digits is 211680, while the sum is 41.
Adding to 143131737245 its reverse (542737131341), we get a palindrome (685868868586).
The spelling of 143131737245 in words is "one hundred forty-three billion, one hundred thirty-one million, seven hundred thirty-seven thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •