Base | Representation |
---|---|
bin | 111010111010110011… |
… | …1101101110100011111 |
3 | 110002120220121202001111 |
4 | 1311311213231310133 |
5 | 4033112003202101 |
6 | 134043105122451 |
7 | 12066316062541 |
oct | 1656547556437 |
9 | 402526552044 |
10 | 126527397151 |
11 | 49729465221 |
12 | 20631929427 |
13 | bc1560b54c |
14 | 61a41dd691 |
15 | 3458069251 |
hex | 1d759edd1f |
126527397151 has 2 divisors, whose sum is σ = 126527397152. Its totient is φ = 126527397150.
The previous prime is 126527397149. The next prime is 126527397197. The reversal of 126527397151 is 151793725621.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 126527397151 - 21 = 126527397149 is a prime.
Together with 126527397149, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 126527397095 and 126527397104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126527397551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63263698575 + 63263698576.
It is an arithmetic number, because the mean of its divisors is an integer number (63263698576).
Almost surely, 2126527397151 is an apocalyptic number.
126527397151 is a deficient number, since it is larger than the sum of its proper divisors (1).
126527397151 is an equidigital number, since it uses as much as digits as its factorization.
126527397151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 793800, while the sum is 49.
The spelling of 126527397151 in words is "one hundred twenty-six billion, five hundred twenty-seven million, three hundred ninety-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •