Base | Representation |
---|---|
bin | 10100011101100011000… |
… | …100110111011110101101 |
3 | 11222102102200022111202202 |
4 | 110131203010313132231 |
5 | 141014211312312442 |
6 | 2553543325031245 |
7 | 203405610160241 |
oct | 24354304673655 |
9 | 4872380274682 |
10 | 1406116525997 |
11 | 4a2370137857 |
12 | 1a86216b5525 |
13 | a2799b81521 |
14 | 4c0b0aac421 |
15 | 2689a113c32 |
hex | 147631377ad |
1406116525997 has 2 divisors, whose sum is σ = 1406116525998. Its totient is φ = 1406116525996.
The previous prime is 1406116525951. The next prime is 1406116525999. The reversal of 1406116525997 is 7995256116041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1405692413161 + 424112836 = 1185619^2 + 20594^2 .
It is a cyclic number.
It is not a de Polignac number, because 1406116525997 - 216 = 1406116460461 is a prime.
Together with 1406116525999, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1406116525999) 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, 703058262998 + 703058262999.
It is an arithmetic number, because the mean of its divisors is an integer number (703058262999).
Almost surely, 21406116525997 is an apocalyptic number.
It is an amenable number.
1406116525997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1406116525997 is an equidigital number, since it uses as much as digits as its factorization.
1406116525997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4082400, while the sum is 56.
The spelling of 1406116525997 in words is "one trillion, four hundred six billion, one hundred sixteen million, five hundred twenty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •