Base | Representation |
---|---|
bin | 1000010100111000110… |
… | …0101100100100000000 |
3 | 111200020010001012110112 |
4 | 2011032030230210000 |
5 | 4320424220344442 |
6 | 145414145250452 |
7 | 13222544564141 |
oct | 2051614544400 |
9 | 450203035415 |
10 | 143045871872 |
11 | 55735735822 |
12 | 23881933a28 |
13 | 10648917947 |
14 | 6ccdd75ac8 |
15 | 3ac3327082 |
hex | 214e32c900 |
143045871872 has 72 divisors (see below), whose sum is σ = 287424254880. Its totient is φ = 71050752000.
The previous prime is 143045871841. The next prime is 143045871889. The reversal of 143045871872 is 278178540341.
It is a self number, because there is not a number n which added to its sum of digits gives 143045871872.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26277983 + ... + 26283425.
It is an arithmetic number, because the mean of its divisors is an integer number (3992003540).
Almost surely, 2143045871872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143045871872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143712127440).
143045871872 is an abundant number, since it is smaller than the sum of its proper divisors (144378383008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143045871872 is an equidigital number, since it uses as much as digits as its factorization.
143045871872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6119 (or 6105 counting only the distinct ones).
The product of its (nonzero) digits is 1505280, while the sum is 50.
The spelling of 143045871872 in words is "one hundred forty-three billion, forty-five million, eight hundred seventy-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •