Base | Representation |
---|---|
bin | 1111000100000… |
… | …01110000011001 |
3 | 22210202210011021 |
4 | 13202001300121 |
5 | 224322014401 |
6 | 20312202441 |
7 | 3063022153 |
oct | 742016031 |
9 | 283683137 |
10 | 126360601 |
11 | 65366654 |
12 | 36399421 |
13 | 202430b3 |
14 | 12ad3ad3 |
15 | b1602a1 |
hex | 7881c19 |
126360601 has 2 divisors, whose sum is σ = 126360602. Its totient is φ = 126360600.
The previous prime is 126360599. The next prime is 126360613. The reversal of 126360601 is 106063621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106110601 + 20250000 = 10301^2 + 4500^2 .
It is an emirp because it is prime and its reverse (106063621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126360601 - 21 = 126360599 is a prime.
It is a super-5 number, since 5×1263606015 (a number of 42 digits) contains 55555 as substring.
Together with 126360599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (126360631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63180300 + 63180301.
It is an arithmetic number, because the mean of its divisors is an integer number (63180301).
Almost surely, 2126360601 is an apocalyptic number.
It is an amenable number.
126360601 is a deficient number, since it is larger than the sum of its proper divisors (1).
126360601 is an equidigital number, since it uses as much as digits as its factorization.
126360601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 126360601 is about 11241.0231295910. The cubic root of 126360601 is about 501.8075920141.
The spelling of 126360601 in words is "one hundred twenty-six million, three hundred sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •