Base | Representation |
---|---|
bin | 11111110111010011101111… |
… | …100000100000101100010101 |
3 | 200101012021101021101001102002 |
4 | 133313103233200200230111 |
5 | 121332024123032223104 |
6 | 1214015305123525045 |
7 | 41342540034645011 |
oct | 3767235740405425 |
9 | 611167337331362 |
10 | 140140211211029 |
11 | 40720147865357 |
12 | 13874141229785 |
13 | 602721bc83823 |
14 | 2686b729b9541 |
15 | 113057da2e01e |
hex | 7f74ef820b15 |
140140211211029 has 2 divisors, whose sum is σ = 140140211211030. Its totient is φ = 140140211211028.
The previous prime is 140140211210999. The next prime is 140140211211041. The reversal of 140140211211029 is 920112112041041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105890479896100 + 34249731314929 = 10290310^2 + 5852327^2 .
It is a cyclic number.
It is not a de Polignac number, because 140140211211029 - 232 = 140135916243733 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 140140211210992 and 140140211211010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140140211211529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70070105605514 + 70070105605515.
It is an arithmetic number, because the mean of its divisors is an integer number (70070105605515).
Almost surely, 2140140211211029 is an apocalyptic number.
It is an amenable number.
140140211211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
140140211211029 is an equidigital number, since it uses as much as digits as its factorization.
140140211211029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 140140211211029 in words is "one hundred forty trillion, one hundred forty billion, two hundred eleven million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •