Base | Representation |
---|---|
bin | 1000010101000111000… |
… | …0011001011000010100 |
3 | 111200101021100210002220 |
4 | 2011101300121120110 |
5 | 4321040010442012 |
6 | 145424120502340 |
7 | 13224201131211 |
oct | 2052160313024 |
9 | 450337323086 |
10 | 143105562132 |
11 | 557663a4a15 |
12 | 2389991a9b0 |
13 | 106580b6920 |
14 | 6cd7c72b08 |
15 | 3ac86b808c |
hex | 2151c19614 |
143105562132 has 48 divisors (see below), whose sum is σ = 359623283712. Its totient is φ = 44029457280.
The previous prime is 143105561999. The next prime is 143105562137. The reversal of 143105562132 is 231265501341.
It is a junction number, because it is equal to n+sod(n) for n = 143105562093 and 143105562102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143105562137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3546253 + ... + 3586379.
It is an arithmetic number, because the mean of its divisors is an integer number (7492151744).
Almost surely, 2143105562132 is an apocalyptic number.
143105562132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
143105562132 is an abundant number, since it is smaller than the sum of its proper divisors (216517721580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143105562132 is a wasteful number, since it uses less digits than its factorization.
143105562132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63008 (or 63006 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 143105562132 in words is "one hundred forty-three billion, one hundred five million, five hundred sixty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •