Base | Representation |
---|---|
bin | 100000011010010001100001… |
… | …011111000010000011111111 |
3 | 200200200222102110110211022000 |
4 | 200122101201133002003333 |
5 | 122140411041044111021 |
6 | 1223055204351553343 |
7 | 42011251446621024 |
oct | 4032214137020377 |
9 | 620628373424260 |
10 | 142543010144511 |
11 | 414671731576a9 |
12 | 13ba195982b853 |
13 | 616c99599bb92 |
14 | 272b19325554b |
15 | 1172d0decdb26 |
hex | 81a4617c20ff |
142543010144511 has 8 divisors (see below), whose sum is σ = 211174829843760. Its totient is φ = 95028673429656.
The previous prime is 142543010144503. The next prime is 142543010144537. The reversal of 142543010144511 is 115441010345241.
142543010144511 is a `hidden beast` number, since 1 + 4 + 2 + 5 + 4 + 30 + 101 + 4 + 4 + 511 = 666.
It is not a de Polignac number, because 142543010144511 - 23 = 142543010144503 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142543010140511) 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, 2639685373020 + ... + 2639685373073.
It is an arithmetic number, because the mean of its divisors is an integer number (26396853730470).
Almost surely, 2142543010144511 is an apocalyptic number.
142543010144511 is a deficient number, since it is larger than the sum of its proper divisors (68631819699249).
142543010144511 is an equidigital number, since it uses as much as digits as its factorization.
142543010144511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5279370746102 (or 5279370746096 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 36.
Adding to 142543010144511 its reverse (115441010345241), we get a palindrome (257984020489752).
The spelling of 142543010144511 in words is "one hundred forty-two trillion, five hundred forty-three billion, ten million, one hundred forty-four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •