Base | Representation |
---|---|
bin | 1111001000001… |
… | …01111011001001 |
3 | 22211210021202122 |
4 | 13210011323021 |
5 | 224441330321 |
6 | 20331541025 |
7 | 3100435364 |
oct | 744057311 |
9 | 284707678 |
10 | 126901961 |
11 | 656a635a |
12 | 365ba775 |
13 | 203a2624 |
14 | 12bd50db |
15 | b21a8ab |
hex | 7905ec9 |
126901961 has 2 divisors, whose sum is σ = 126901962. Its totient is φ = 126901960.
The previous prime is 126901919. The next prime is 126901963. The reversal of 126901961 is 169109621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110901961 + 16000000 = 10531^2 + 4000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126901961 is a prime.
It is a super-2 number, since 2×1269019612 = 32208215411291042, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 126901963, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (126901963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63450980 + 63450981.
It is an arithmetic number, because the mean of its divisors is an integer number (63450981).
Almost surely, 2126901961 is an apocalyptic number.
It is an amenable number.
126901961 is a deficient number, since it is larger than the sum of its proper divisors (1).
126901961 is an equidigital number, since it uses as much as digits as its factorization.
126901961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 35.
The square root of 126901961 is about 11265.0770525549. The cubic root of 126901961 is about 502.5231935698.
The spelling of 126901961 in words is "one hundred twenty-six million, nine hundred one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •