Base | Representation |
---|---|
bin | 11111111010011010000001… |
… | …011101001110100001010001 |
3 | 200101221121220210001202121002 |
4 | 133322122001131032201101 |
5 | 121344021133441034301 |
6 | 1214301155144511345 |
7 | 41364114662116016 |
oct | 3772320135164121 |
9 | 611847823052532 |
10 | 140353113221201 |
11 | 407a246a462781 |
12 | 138a945977b555 |
13 | 604131b285b3a |
14 | 26931ac3d970d |
15 | 1135d8e9eb16b |
hex | 7fa68174e851 |
140353113221201 has 24 divisors (see below), whose sum is σ = 152268120164160. Its totient is φ = 129204672212000.
The previous prime is 140353113221161. The next prime is 140353113221231. The reversal of 140353113221201 is 102122311353041.
It is not a de Polignac number, because 140353113221201 - 242 = 135955066710097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140353113221231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9937775 + ... + 19479876.
It is an arithmetic number, because the mean of its divisors is an integer number (6344505006840).
Almost surely, 2140353113221201 is an apocalyptic number.
It is an amenable number.
140353113221201 is a deficient number, since it is larger than the sum of its proper divisors (11915006942959).
140353113221201 is a wasteful number, since it uses less digits than its factorization.
140353113221201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29418037 (or 29418014 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 140353113221201 its reverse (102122311353041), we get a palindrome (242475424574242).
The spelling of 140353113221201 in words is "one hundred forty trillion, three hundred fifty-three billion, one hundred thirteen million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •