Base | Representation |
---|---|
bin | 1111001000100… |
… | …10111000001101 |
3 | 22211212222112211 |
4 | 13210102320031 |
5 | 230000030041 |
6 | 20333030421 |
7 | 3101046154 |
oct | 744227015 |
9 | 284788484 |
10 | 126955021 |
11 | 65732206 |
12 | 36625411 |
13 | 203c081b |
14 | 12c0a59b |
15 | b22b481 |
hex | 7912e0d |
126955021 has 2 divisors, whose sum is σ = 126955022. Its totient is φ = 126955020.
The previous prime is 126955007. The next prime is 126955051. The reversal of 126955021 is 120559621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81540900 + 45414121 = 9030^2 + 6739^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126955021 is a prime.
It is a super-2 number, since 2×1269550212 = 32235154714220882, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126955001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63477510 + 63477511.
It is an arithmetic number, because the mean of its divisors is an integer number (63477511).
Almost surely, 2126955021 is an apocalyptic number.
It is an amenable number.
126955021 is a deficient number, since it is larger than the sum of its proper divisors (1).
126955021 is an equidigital number, since it uses as much as digits as its factorization.
126955021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 126955021 is about 11267.4318724366. The cubic root of 126955021 is about 502.5932218160.
Subtracting from 126955021 its product of nonzero digits (5400), we obtain a palindrome (126949621).
The spelling of 126955021 in words is "one hundred twenty-six million, nine hundred fifty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •