Base | Representation |
---|---|
bin | 10100011101100011111… |
… | …001010001101111100101 |
3 | 11222102110122011112012222 |
4 | 110131203321101233211 |
5 | 141014223321440221 |
6 | 2553544535322125 |
7 | 203406135021644 |
oct | 24354371215745 |
9 | 4872418145188 |
10 | 1406130265061 |
11 | 4a2377971155 |
12 | 1a8626220345 |
13 | a279c981c52 |
14 | 4c0b284735b |
15 | 2689b4299ab |
hex | 14763e51be5 |
1406130265061 has 2 divisors, whose sum is σ = 1406130265062. Its totient is φ = 1406130265060.
The previous prime is 1406130264997. The next prime is 1406130265087. The reversal of 1406130265061 is 1605620316041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1159002964900 + 247127300161 = 1076570^2 + 497119^2 .
It is a cyclic number.
It is not a de Polignac number, because 1406130265061 - 26 = 1406130264997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1406135265061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 703065132530 + 703065132531.
It is an arithmetic number, because the mean of its divisors is an integer number (703065132531).
Almost surely, 21406130265061 is an apocalyptic number.
It is an amenable number.
1406130265061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1406130265061 is an equidigital number, since it uses as much as digits as its factorization.
1406130265061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 1406130265061 in words is "one trillion, four hundred six billion, one hundred thirty million, two hundred sixty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •