Base | Representation |
---|---|
bin | 100000100001000111010101… |
… | …101000110110100011010100 |
3 | 200202100220211112212121220222 |
4 | 200201013111220312203110 |
5 | 122221111322214423444 |
6 | 1224055152122013512 |
7 | 42060233123246444 |
oct | 4041072550664324 |
9 | 622326745777828 |
10 | 143013110311124 |
11 | 41628579476799 |
12 | 14058a95347298 |
13 | 61a5103426141 |
14 | 2745c2b466124 |
15 | 1180174bc1eee |
hex | 8211d5a368d4 |
143013110311124 has 12 divisors (see below), whose sum is σ = 254995074045684. Its totient is φ = 70157374869504.
The previous prime is 143013110311117. The next prime is 143013110311151. The reversal of 143013110311124 is 421113011310341.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 50032025582224 + 92981084728900 = 7073332^2 + 9642670^2 .
It is a junction number, because it is equal to n+sod(n) for n = 143013110311093 and 143013110311102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337295071277 + ... + 337295071700.
It is an arithmetic number, because the mean of its divisors is an integer number (21249589503807).
Almost surely, 2143013110311124 is an apocalyptic number.
It is an amenable number.
143013110311124 is a deficient number, since it is larger than the sum of its proper divisors (111981963734560).
143013110311124 is a wasteful number, since it uses less digits than its factorization.
143013110311124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674590143034 (or 674590143032 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 143013110311124 its reverse (421113011310341), we get a palindrome (564126121621465).
The spelling of 143013110311124 in words is "one hundred forty-three trillion, thirteen billion, one hundred ten million, three hundred eleven thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •