Base | Representation |
---|---|
bin | 11100101011100000110011… |
… | …011111000000000010111101 |
3 | 121112121102200022102220210112 |
4 | 130223200303133000002331 |
5 | 113013100412102013342 |
6 | 1124133455404515405 |
7 | 35365662236646563 |
oct | 3453406337000275 |
9 | 545542608386715 |
10 | 126135463313597 |
11 | 372108277720a1 |
12 | 12191a9354bb65 |
13 | 554c6a549b71a |
14 | 2320dbbb51a33 |
15 | e8b115dc6682 |
hex | 72b8337c00bd |
126135463313597 has 2 divisors, whose sum is σ = 126135463313598. Its totient is φ = 126135463313596.
The previous prime is 126135463313593. The next prime is 126135463313627. The reversal of 126135463313597 is 795313364531621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100089199882681 + 26046263430916 = 10004459^2 + 5103554^2 .
It is a cyclic number.
It is not a de Polignac number, because 126135463313597 - 22 = 126135463313593 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126135463313593) 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, 63067731656798 + 63067731656799.
It is an arithmetic number, because the mean of its divisors is an integer number (63067731656799).
Almost surely, 2126135463313597 is an apocalyptic number.
It is an amenable number.
126135463313597 is a deficient number, since it is larger than the sum of its proper divisors (1).
126135463313597 is an equidigital number, since it uses as much as digits as its factorization.
126135463313597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36741600, while the sum is 59.
The spelling of 126135463313597 in words is "one hundred twenty-six trillion, one hundred thirty-five billion, four hundred sixty-three million, three hundred thirteen thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •