Base | Representation |
---|---|
bin | 1000001101000101011… |
… | …0111110000011011000 |
3 | 111110211010221122221221 |
4 | 2003101112332003120 |
5 | 4302132030203302 |
6 | 144430245541424 |
7 | 13116623146000 |
oct | 2032126760330 |
9 | 443733848857 |
10 | 140951412952 |
11 | 54860441839 |
12 | 23398414874 |
13 | 103a3a19c3c |
14 | 6b71b2d000 |
15 | 39ee506937 |
hex | 20d15be0d8 |
140951412952 has 32 divisors (see below), whose sum is σ = 308202804000. Its totient is φ = 60407747232.
The previous prime is 140951412947. The next prime is 140951412967. The reversal of 140951412952 is 259214159041.
It is a junction number, because it is equal to n+sod(n) for n = 140951412899 and 140951412908.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 25680823 + ... + 25686310.
It is an arithmetic number, because the mean of its divisors is an integer number (9631337625).
Almost surely, 2140951412952 is an apocalyptic number.
It is an amenable number.
140951412952 is an abundant number, since it is smaller than the sum of its proper divisors (167251391048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140951412952 is an equidigital number, since it uses as much as digits as its factorization.
140951412952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51367160 (or 51367142 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 140951412952 in words is "one hundred forty billion, nine hundred fifty-one million, four hundred twelve thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •