Base | Representation |
---|---|
bin | 1111000100000… |
… | …10101010110101 |
3 | 22210202222021210 |
4 | 13202002222311 |
5 | 224322124331 |
6 | 20312232033 |
7 | 3063036105 |
oct | 742025265 |
9 | 283688253 |
10 | 126364341 |
11 | 65369444 |
12 | 3639b619 |
13 | 202449cc |
14 | 12ad5205 |
15 | b161446 |
hex | 7882ab5 |
126364341 has 8 divisors (see below), whose sum is σ = 172070784. Its totient is φ = 82450400.
The previous prime is 126364327. The next prime is 126364379. The reversal of 126364341 is 143463621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 126364341 - 29 = 126363829 is a prime.
It is a super-3 number, since 3×1263643413 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126364299 and 126364308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126364321) 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 7 ways as a sum of consecutive naturals, for example, 447960 + ... + 448241.
It is an arithmetic number, because the mean of its divisors is an integer number (21508848).
Almost surely, 2126364341 is an apocalyptic number.
It is an amenable number.
126364341 is a deficient number, since it is larger than the sum of its proper divisors (45706443).
126364341 is an equidigital number, since it uses as much as digits as its factorization.
126364341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896251.
The product of its digits is 10368, while the sum is 30.
The square root of 126364341 is about 11241.1894833243. The cubic root of 126364341 is about 501.8125427710.
The spelling of 126364341 in words is "one hundred twenty-six million, three hundred sixty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •