Base | Representation |
---|---|
bin | 1000001010010111010… |
… | …0101101011111001001 |
3 | 111101221020120110002121 |
4 | 2002211310231133021 |
5 | 4244133034340123 |
6 | 144225554531241 |
7 | 13062543635623 |
oct | 2024564553711 |
9 | 441836513077 |
10 | 140221011913 |
11 | 54516118714 |
12 | 23213896b21 |
13 | 102b85c5188 |
14 | 6b02b1dc13 |
15 | 39aa32b75d |
hex | 20a5d2d7c9 |
140221011913 has 2 divisors, whose sum is σ = 140221011914. Its totient is φ = 140221011912.
The previous prime is 140221011851. The next prime is 140221011937. The reversal of 140221011913 is 319110122041.
140221011913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127468278729 + 12752733184 = 357027^2 + 112928^2 .
It is a cyclic number.
It is not a de Polignac number, because 140221011913 - 229 = 139684141001 is a prime.
It is not a weakly prime, because it can be changed into another prime (140221051913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70110505956 + 70110505957.
It is an arithmetic number, because the mean of its divisors is an integer number (70110505957).
Almost surely, 2140221011913 is an apocalyptic number.
It is an amenable number.
140221011913 is a deficient number, since it is larger than the sum of its proper divisors (1).
140221011913 is an equidigital number, since it uses as much as digits as its factorization.
140221011913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 140221011913 its reverse (319110122041), we get a palindrome (459331133954).
The spelling of 140221011913 in words is "one hundred forty billion, two hundred twenty-one million, eleven thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •