Base | Representation |
---|---|
bin | 1000010101001110011… |
… | …0011011000111000100 |
3 | 111200110102120200220210 |
4 | 2011103212123013010 |
5 | 4321120421032322 |
6 | 145431143555420 |
7 | 13225025123424 |
oct | 2052346330704 |
9 | 450412520823 |
10 | 143136502212 |
11 | 55781907730 |
12 | 238a815bb70 |
13 | 1066162a772 |
14 | 6cdc008484 |
15 | 3acb27a70c |
hex | 215399b1c4 |
143136502212 has 48 divisors (see below), whose sum is σ = 365938574400. Its totient is φ = 43185279360.
The previous prime is 143136502211. The next prime is 143136502217. The reversal of 143136502212 is 212205631341.
It is a self number, because there is not a number n which added to its sum of digits gives 143136502212.
It is not an unprimeable number, because it can be changed into a prime (143136502211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2337387 + ... + 2397842.
It is an arithmetic number, because the mean of its divisors is an integer number (7623720300).
Almost surely, 2143136502212 is an apocalyptic number.
143136502212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
143136502212 is an abundant number, since it is smaller than the sum of its proper divisors (222802072188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143136502212 is a wasteful number, since it uses less digits than its factorization.
143136502212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4735476 (or 4735474 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 143136502212 in words is "one hundred forty-three billion, one hundred thirty-six million, five hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •