Base | Representation |
---|---|
bin | 11111111011010000000011… |
… | …000101001111000111010000 |
3 | 200102011011122112211202002222 |
4 | 133323100003011033013100 |
5 | 121400443434332420404 |
6 | 1214343551302000212 |
7 | 41401240340204225 |
oct | 3773200305170720 |
9 | 612134575752088 |
10 | 140411122545104 |
11 | 40815028191384 |
12 | 138b8748a16068 |
13 | 6046934481878 |
14 | 2695d1273d94c |
15 | 11376375cddbe |
hex | 7fb40314f1d0 |
140411122545104 has 10 divisors (see below), whose sum is σ = 272046549931170. Its totient is φ = 70205561272544.
The previous prime is 140411122545097. The next prime is 140411122545139. The reversal of 140411122545104 is 401545221114041.
It can be written as a sum of positive squares in only one way, i.e., 133560088512400 + 6851034032704 = 11556820^2 + 2617448^2 .
It is a congruent number.
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 as a sum of consecutive naturals, namely, 4387847579519 + ... + 4387847579550.
It is an arithmetic number, because the mean of its divisors is an integer number (27204654993117).
Almost surely, 2140411122545104 is an apocalyptic number.
It is an amenable number.
140411122545104 is a deficient number, since it is larger than the sum of its proper divisors (131635427386066).
140411122545104 is an equidigital number, since it uses as much as digits as its factorization.
140411122545104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8775695159077 (or 8775695159071 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 35.
Adding to 140411122545104 its reverse (401545221114041), we get a palindrome (541956343659145).
The spelling of 140411122545104 in words is "one hundred forty trillion, four hundred eleven billion, one hundred twenty-two million, five hundred forty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •