Base | Representation |
---|---|
bin | 1000011000001101010… |
… | …1011001110011111100 |
3 | 111202112020111211011220 |
4 | 2012003111121303330 |
5 | 4324240430044222 |
6 | 150042432513340 |
7 | 13253621155350 |
oct | 2060325316374 |
9 | 452466454156 |
10 | 143937346812 |
11 | 56052975076 |
12 | 23a903ab850 |
13 | 1075b517bcc |
14 | 6d76513460 |
15 | 3b2671cb5c |
hex | 2183559cfc |
143937346812 has 48 divisors (see below), whose sum is σ = 384101098752. Its totient is φ = 41096223360.
The previous prime is 143937346811. The next prime is 143937346849. The reversal of 143937346812 is 218643739341.
143937346812 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143937346811) 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 15 ways as a sum of consecutive naturals, for example, 477514 + ... + 718257.
It is an arithmetic number, because the mean of its divisors is an integer number (8002106224).
Almost surely, 2143937346812 is an apocalyptic number.
143937346812 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
143937346812 is an abundant number, since it is smaller than the sum of its proper divisors (240163751940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143937346812 is a wasteful number, since it uses less digits than its factorization.
143937346812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1197218 (or 1197216 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 51.
The spelling of 143937346812 in words is "one hundred forty-three billion, nine hundred thirty-seven million, three hundred forty-six thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •