Base | Representation |
---|---|
bin | 100000100010110000111110… |
… | …111000101110100011011011 |
3 | 200202202202122000200120020021 |
4 | 200202300332320232203123 |
5 | 122224441131034330133 |
6 | 1224223232134011311 |
7 | 42101360134200664 |
oct | 4042607670564333 |
9 | 622682560616207 |
10 | 143126545230043 |
11 | 41671699532271 |
12 | 14076a724a6b37 |
13 | 61b2a10453a3b |
14 | 274b50c90636b |
15 | 11830b361d52d |
hex | 822c3ee2e8db |
143126545230043 has 8 divisors (see below), whose sum is σ = 145559779545488. Its totient is φ = 140706083798784.
The previous prime is 143126545230037. The next prime is 143126545230047. The reversal of 143126545230043 is 340032545621341.
143126545230043 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 a de Polignac number, because none of the positive numbers 2k-143126545230043 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143126545230047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3193198446 + ... + 3193243267.
It is an arithmetic number, because the mean of its divisors is an integer number (18194972443186).
Almost surely, 2143126545230043 is an apocalyptic number.
143126545230043 is a deficient number, since it is larger than the sum of its proper divisors (2433234315445).
143126545230043 is an equidigital number, since it uses as much as digits as its factorization.
143126545230043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6386442093.
The product of its (nonzero) digits is 1036800, while the sum is 43.
The spelling of 143126545230043 in words is "one hundred forty-three trillion, one hundred twenty-six billion, five hundred forty-five million, two hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •