Base | Representation |
---|---|
bin | 1000010111101101110… |
… | …0000101110000011110 |
3 | 111202012000020220112220 |
4 | 2011323130011300132 |
5 | 4324003022210300 |
6 | 150021341410210 |
7 | 13250422220412 |
oct | 2057334056036 |
9 | 452160226486 |
10 | 143804881950 |
11 | 55a9511a284 |
12 | 23a53b69966 |
13 | 10739c48532 |
14 | 6d62ab0d42 |
15 | 3b19ca3da0 |
hex | 217b705c1e |
143804881950 has 48 divisors (see below), whose sum is σ = 356682694656. Its totient is φ = 38342959200.
The previous prime is 143804881939. The next prime is 143804882017. The reversal of 143804881950 is 59188408341.
143804881950 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 143804881893 and 143804881902.
It is a congruent number.
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 in 23 ways as a sum of consecutive naturals, for example, 1170129 + ... + 1287171.
It is an arithmetic number, because the mean of its divisors is an integer number (7430889472).
Almost surely, 2143804881950 is an apocalyptic number.
143804881950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143804881950 is an abundant number, since it is smaller than the sum of its proper divisors (212877812706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143804881950 is a wasteful number, since it uses less digits than its factorization.
143804881950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125249 (or 125244 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 51.
The spelling of 143804881950 in words is "one hundred forty-three billion, eight hundred four million, eight hundred eighty-one thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •