Base | Representation |
---|---|
bin | 11111111011000110001011… |
… | …110011101110110101001100 |
3 | 200102010011022102222120222022 |
4 | 133323012023303232311030 |
5 | 121400310242033030012 |
6 | 1214335040323505312 |
7 | 41400414025116263 |
oct | 3773061363566514 |
9 | 612104272876868 |
10 | 140400531533132 |
11 | 408105928a8322 |
12 | 138b6691b28238 |
13 | 60459371c4890 |
14 | 26955c9cd35da |
15 | 11372178cb472 |
hex | 7fb18bceed4c |
140400531533132 has 24 divisors (see below), whose sum is σ = 264716397076656. Its totient is φ = 64771985239488.
The previous prime is 140400531533131. The next prime is 140400531533167. The reversal of 140400531533132 is 231335135004041.
It is a junction number, because it is equal to n+sod(n) for n = 140400531533092 and 140400531533101.
It is not an unprimeable number, because it can be changed into a prime (140400531533131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 588631358 + ... + 588869829.
It is an arithmetic number, because the mean of its divisors is an integer number (11029849878194).
Almost surely, 2140400531533132 is an apocalyptic number.
It is an amenable number.
140400531533132 is a deficient number, since it is larger than the sum of its proper divisors (124315865543524).
140400531533132 is a wasteful number, since it uses less digits than its factorization.
140400531533132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1177503497 (or 1177503495 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 140400531533132 its reverse (231335135004041), we get a palindrome (371735666537173).
The spelling of 140400531533132 in words is "one hundred forty trillion, four hundred billion, five hundred thirty-one million, five hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •