Base | Representation |
---|---|
bin | 11111110101011100010101… |
… | …100001100111000000000101 |
3 | 200100202000110000101102121210 |
4 | 133311130111201213000011 |
5 | 121322424034000424331 |
6 | 1213440342545002033 |
7 | 41330350611522450 |
oct | 3765342541470005 |
9 | 610660400342553 |
10 | 140012000014341 |
11 | 406808349a2674 |
12 | 1385331b623319 |
13 | 60180c887b8c0 |
14 | 268088cd10497 |
15 | 112c077c61446 |
hex | 7f5715867005 |
140012000014341 has 64 divisors (see below), whose sum is σ = 229862533275648. Its totient is φ = 73820589228288.
The previous prime is 140012000014303. The next prime is 140012000014357. The reversal of 140012000014341 is 143410000210041.
It is not a de Polignac number, because 140012000014341 - 210 = 140012000013317 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140012000014541) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 9634066911 + ... + 9634081443.
It is an arithmetic number, because the mean of its divisors is an integer number (3591602082432).
Almost surely, 2140012000014341 is an apocalyptic number.
It is an amenable number.
140012000014341 is a deficient number, since it is larger than the sum of its proper divisors (89850533261307).
140012000014341 is a wasteful number, since it uses less digits than its factorization.
140012000014341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27370.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 140012000014341 its reverse (143410000210041), we get a palindrome (283422000224382).
The spelling of 140012000014341 in words is "one hundred forty trillion, twelve billion, fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •