Base | Representation |
---|---|
bin | 100000101010100111101000… |
… | …110010100110000111110100 |
3 | 200211200100202010210001120210 |
4 | 200222213220302212013310 |
5 | 122312312003231130424 |
6 | 1225315212145225420 |
7 | 42155355005521506 |
oct | 4052475062460764 |
9 | 624610663701523 |
10 | 143666266661364 |
11 | 4185a581181a57 |
12 | 1414359a032270 |
13 | 6221894a1b015 |
14 | 27696ad301d76 |
15 | 119215155e729 |
hex | 82a9e8ca61f4 |
143666266661364 has 24 divisors (see below), whose sum is σ = 336976374163968. Its totient is φ = 47638029084160.
The previous prime is 143666266661341. The next prime is 143666266661369. The reversal of 143666266661364 is 463166662666341.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 143666266661295 and 143666266661304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143666266661369) 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, 31340806317 + ... + 31340810900.
It is an arithmetic number, because the mean of its divisors is an integer number (14040682256832).
Almost surely, 2143666266661364 is an apocalyptic number.
It is an amenable number.
143666266661364 is an abundant number, since it is smaller than the sum of its proper divisors (193310107502604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143666266661364 is a wasteful number, since it uses less digits than its factorization.
143666266661364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62681617415 (or 62681617413 counting only the distinct ones).
The product of its digits is 483729408, while the sum is 66.
The spelling of 143666266661364 in words is "one hundred forty-three trillion, six hundred sixty-six billion, two hundred sixty-six million, six hundred sixty-one thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •