Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …101100010101001010001000 |
3 | 200101110020112210202221022222 |
4 | 133320113220230111022020 |
5 | 121334222422444004112 |
6 | 1214113003014033212 |
7 | 41351030415411362 |
oct | 3770275054251210 |
9 | 611406483687288 |
10 | 140213111313032 |
11 | 40749056a95a3a |
12 | 138862a7348808 |
13 | 60310691a6464 |
14 | 268a4ca831d32 |
15 | 11323e8a4e372 |
hex | 7f85e8b15288 |
140213111313032 has 64 divisors (see below), whose sum is σ = 277693021872000. Its totient is φ = 66187168464384.
The previous prime is 140213111313019. The next prime is 140213111313043. The reversal of 140213111313032 is 230313111312041.
It is a junction number, because it is equal to n+sod(n) for n = 140213111312992 and 140213111313010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1292959469 + ... + 1293067907.
It is an arithmetic number, because the mean of its divisors is an integer number (4338953466750).
Almost surely, 2140213111313032 is an apocalyptic number.
It is an amenable number.
140213111313032 is a deficient number, since it is larger than the sum of its proper divisors (137479910558968).
140213111313032 is a wasteful number, since it uses less digits than its factorization.
140213111313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137790 (or 137786 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 140213111313032 its reverse (230313111312041), we get a palindrome (370526222625073).
Subtracting 140213111313032 from its reverse (230313111312041), we obtain a palindrome (90099999999009).
The spelling of 140213111313032 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred eleven million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •