Base | Representation |
---|---|
bin | 11111111011001111111111… |
… | …000011111101000010010011 |
3 | 200102011011110211221011220001 |
4 | 133323033333003331002103 |
5 | 121400443320101200201 |
6 | 1214343540452230431 |
7 | 41401235561011351 |
oct | 3773177703750223 |
9 | 612134424834801 |
10 | 140411055100051 |
11 | 40814aa310596a |
12 | 138b872a30b417 |
13 | 60469234c8c58 |
14 | 2695d077c47d1 |
15 | 113763170a301 |
hex | 7fb3ff0fd093 |
140411055100051 has 32 divisors (see below), whose sum is σ = 145947819499776. Its totient is φ = 135003108240000.
The previous prime is 140411055100003. The next prime is 140411055100073. The reversal of 140411055100051 is 150001550114041.
It is a cyclic number.
It is not a de Polignac number, because 140411055100051 - 229 = 140410518229139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140411055099992 and 140411055100019.
It is not an unprimeable number, because it can be changed into a prime (140411055100451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1753979976 + ... + 1754060026.
It is an arithmetic number, because the mean of its divisors is an integer number (4560869359368).
Almost surely, 2140411055100051 is an apocalyptic number.
140411055100051 is a deficient number, since it is larger than the sum of its proper divisors (5536764399725).
140411055100051 is a wasteful number, since it uses less digits than its factorization.
140411055100051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82723.
The product of its (nonzero) digits is 2000, while the sum is 28.
The spelling of 140411055100051 in words is "one hundred forty trillion, four hundred eleven billion, fifty-five million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •