Base | Representation |
---|---|
bin | 11111111011011010001101… |
… | …100010111111010100101111 |
3 | 200102012012211002120002010112 |
4 | 133323122031202333110233 |
5 | 121401133312044111101 |
6 | 1214352554221130235 |
7 | 41402104642116566 |
oct | 3773321542772457 |
9 | 612165732502115 |
10 | 140422035535151 |
11 | 408197182a0317 |
12 | 138ba8936b997b |
13 | 6047983363226 |
14 | 2696669c40bdd |
15 | 1137a756d26bb |
hex | 7fb68d8bf52f |
140422035535151 has 2 divisors, whose sum is σ = 140422035535152. Its totient is φ = 140422035535150.
The previous prime is 140422035535147. The next prime is 140422035535183. The reversal of 140422035535151 is 151535530224041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 140422035535151 - 22 = 140422035535147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140422035535099 and 140422035535108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140422032535151) 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 as a sum of consecutive naturals, namely, 70211017767575 + 70211017767576.
It is an arithmetic number, because the mean of its divisors is an integer number (70211017767576).
Almost surely, 2140422035535151 is an apocalyptic number.
140422035535151 is a deficient number, since it is larger than the sum of its proper divisors (1).
140422035535151 is an equidigital number, since it uses as much as digits as its factorization.
140422035535151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360000, while the sum is 41.
Adding to 140422035535151 its reverse (151535530224041), we get a palindrome (291957565759192).
The spelling of 140422035535151 in words is "one hundred forty trillion, four hundred twenty-two billion, thirty-five million, five hundred thirty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •