Base | Representation |
---|---|
bin | 1111000110001… |
… | …10010000101101 |
3 | 22211022001001201 |
4 | 13203012100231 |
5 | 224410004242 |
6 | 20322205501 |
7 | 3065301214 |
oct | 743062055 |
9 | 284261051 |
10 | 126641197 |
11 | 65538451 |
12 | 364b3891 |
13 | 20310a27 |
14 | 12b6807b |
15 | b1b84b7 |
hex | 78c642d |
126641197 has 4 divisors (see below), whose sum is σ = 132147360. Its totient is φ = 121135036.
The previous prime is 126641167. The next prime is 126641201. The reversal of 126641197 is 791146621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126641197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126641117) 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 in 3 ways as a sum of consecutive naturals, for example, 2753047 + ... + 2753092.
It is an arithmetic number, because the mean of its divisors is an integer number (33036840).
Almost surely, 2126641197 is an apocalyptic number.
It is an amenable number.
126641197 is a deficient number, since it is larger than the sum of its proper divisors (5506163).
126641197 is an equidigital number, since it uses as much as digits as its factorization.
126641197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5506162.
The product of its digits is 18144, while the sum is 37.
The square root of 126641197 is about 11253.4971009016. The cubic root of 126641197 is about 502.1787549306.
It can be divided in two parts, 12664 and 1197, that added together give a triangular number (13861 = T166).
The spelling of 126641197 in words is "one hundred twenty-six million, six hundred forty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •