Base | Representation |
---|---|
bin | 11111110111100010011101… |
… | …101111000101110110101011 |
3 | 200101020210011221211121110001 |
4 | 133313202131233011312223 |
5 | 121332304011401430411 |
6 | 1214030441503203431 |
7 | 41343636545252044 |
oct | 3767423557056653 |
9 | 611223157747401 |
10 | 140156019170731 |
11 | 40726919a64463 |
12 | 138772132a6577 |
13 | 602886b00b735 |
14 | 268783223b8cb |
15 | 1130ba673ddc1 |
hex | 7f789dbc5dab |
140156019170731 has 2 divisors, whose sum is σ = 140156019170732. Its totient is φ = 140156019170730.
The previous prime is 140156019170701. The next prime is 140156019170737. The reversal of 140156019170731 is 137071910651041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140156019170731 - 227 = 140155884953003 is a prime.
It is a super-2 number, since 2×1401560191707312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140156019170737) 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, 70078009585365 + 70078009585366.
It is an arithmetic number, because the mean of its divisors is an integer number (70078009585366).
Almost surely, 2140156019170731 is an apocalyptic number.
140156019170731 is a deficient number, since it is larger than the sum of its proper divisors (1).
140156019170731 is an equidigital number, since it uses as much as digits as its factorization.
140156019170731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 46.
The spelling of 140156019170731 in words is "one hundred forty trillion, one hundred fifty-six billion, nineteen million, one hundred seventy thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •