Base | Representation |
---|---|
bin | 1111000110001… |
… | …01111110110011 |
3 | 22211021222111021 |
4 | 13203011332303 |
5 | 224404440201 |
6 | 20322200311 |
7 | 3065264656 |
oct | 743057663 |
9 | 284258437 |
10 | 126640051 |
11 | 655375aa |
12 | 364b3097 |
13 | 20310355 |
14 | 12b6789d |
15 | b1b7ea1 |
hex | 78c5fb3 |
126640051 has 4 divisors (see below), whose sum is σ = 126797400. Its totient is φ = 126482704.
The previous prime is 126640049. The next prime is 126640109. The reversal of 126640051 is 150046621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150046621 = 743 ⋅201947.
It is a cyclic number.
It is not a de Polignac number, because 126640051 - 21 = 126640049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126639998 and 126640025.
It is not an unprimeable number, because it can be changed into a prime (126644051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77461 + ... + 79078.
It is an arithmetic number, because the mean of its divisors is an integer number (31699350).
Almost surely, 2126640051 is an apocalyptic number.
126640051 is a deficient number, since it is larger than the sum of its proper divisors (157349).
126640051 is an equidigital number, since it uses as much as digits as its factorization.
126640051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157348.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 126640051 is about 11253.4461832809. The cubic root of 126640051 is about 502.1772401560.
Adding to 126640051 its reverse (150046621), we get a palindrome (276686672).
The spelling of 126640051 in words is "one hundred twenty-six million, six hundred forty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •