Base | Representation |
---|---|
bin | 100000100001100100000111… |
… | …011110000011011100101000 |
3 | 200202110212121002011222010002 |
4 | 200201210013132003130220 |
5 | 122222113113321042412 |
6 | 1224121302253242132 |
7 | 42062405641601546 |
oct | 4041440736033450 |
9 | 622425532158102 |
10 | 143044011112232 |
11 | 4163a696139a4a |
12 | 14062a79a93348 |
13 | 61a7cb9305439 |
14 | 274751d398d96 |
15 | 1180d82934dc2 |
hex | 821907783728 |
143044011112232 has 8 divisors (see below), whose sum is σ = 268207520835450. Its totient is φ = 71522005556112.
The previous prime is 143044011112147. The next prime is 143044011112313. The reversal of 143044011112232 is 232211110440341.
It can be written as a sum of positive squares in only one way, i.e., 92119031753956 + 50924979358276 = 9597866^2 + 7136174^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 143044011112195 and 143044011112204.
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 as a sum of consecutive naturals, namely, 8940250694507 + ... + 8940250694522.
Almost surely, 2143044011112232 is an apocalyptic number.
It is an amenable number.
143044011112232 is a deficient number, since it is larger than the sum of its proper divisors (125163509723218).
143044011112232 is a wasteful number, since it uses less digits than its factorization.
143044011112232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17880501389035 (or 17880501389031 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 143044011112232 its reverse (232211110440341), we get a palindrome (375255121552573).
The spelling of 143044011112232 in words is "one hundred forty-three trillion, forty-four billion, eleven million, one hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •