Base | Representation |
---|---|
bin | 100000100010110110100100… |
… | …100010001011001000001111 |
3 | 200202210100010012100222000222 |
4 | 200202312210202023020033 |
5 | 122230040423130423403 |
6 | 1224230103401541555 |
7 | 42101661624155360 |
oct | 4042664442131017 |
9 | 622710105328028 |
10 | 143132545561103 |
11 | 4167419856985a |
12 | 14078067aa48bb |
13 | 61b34586073a7 |
14 | 274b91b79db67 |
15 | 11833152be338 |
hex | 822da488b20f |
143132545561103 has 32 divisors (see below), whose sum is σ = 174268330022400. Its totient is φ = 114831313099776.
The previous prime is 143132545561097. The next prime is 143132545561127. The reversal of 143132545561103 is 301165545231341.
It is not a de Polignac number, because 143132545561103 - 28 = 143132545560847 is a prime.
It is a super-2 number, since 2×1431325455611032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143132545561163) by changing a digit.
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 in 31 ways as a sum of consecutive naturals, for example, 10509593 + ... + 19917746.
It is an arithmetic number, because the mean of its divisors is an integer number (5445885313200).
Almost surely, 2143132545561103 is an apocalyptic number.
143132545561103 is a deficient number, since it is larger than the sum of its proper divisors (31135784461297).
143132545561103 is a wasteful number, since it uses less digits than its factorization.
143132545561103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30427791.
The product of its (nonzero) digits is 648000, while the sum is 44.
The spelling of 143132545561103 in words is "one hundred forty-three trillion, one hundred thirty-two billion, five hundred forty-five million, five hundred sixty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •