Base | Representation |
---|---|
bin | 11111110111001011010110… |
… | …011101110010111000101010 |
3 | 200101011102010100022201110222 |
4 | 133313023112131302320222 |
5 | 121331402144442242442 |
6 | 1214011215102410042 |
7 | 41342100540364142 |
oct | 3767132635627052 |
9 | 611142110281428 |
10 | 140131201134122 |
11 | 40717343911200 |
12 | 13872447890922 |
13 | 60264143b5983 |
14 | 268655a0dd922 |
15 | 1130202a118d2 |
hex | 7f72d6772e2a |
140131201134122 has 24 divisors (see below), whose sum is σ = 236415853093728. Its totient is φ = 62214698173320.
The previous prime is 140131201134121. The next prime is 140131201134137. The reversal of 140131201134122 is 221431102131041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 140131201134091 and 140131201134100.
It is not an unprimeable number, because it can be changed into a prime (140131201134121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6733182038 + ... + 6733202849.
It is an arithmetic number, because the mean of its divisors is an integer number (9850660545572).
Almost surely, 2140131201134122 is an apocalyptic number.
140131201134122 is a deficient number, since it is larger than the sum of its proper divisors (96284651959606).
140131201134122 is a wasteful number, since it uses less digits than its factorization.
140131201134122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13466384954 (or 13466384943 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 140131201134122 its reverse (221431102131041), we get a palindrome (361562303265163).
The spelling of 140131201134122 in words is "one hundred forty trillion, one hundred thirty-one billion, two hundred one million, one hundred thirty-four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •