Base | Representation |
---|---|
bin | 1111000101111… |
… | …11101011010111 |
3 | 22211020200001222 |
4 | 13202333223113 |
5 | 224403123411 |
6 | 20321440555 |
7 | 3065126462 |
oct | 742775327 |
9 | 284220058 |
10 | 126614231 |
11 | 6551a167 |
12 | 364a015b |
13 | 20301683 |
14 | 12b5c2d9 |
15 | b1b04db |
hex | 78bfad7 |
126614231 has 4 divisors (see below), whose sum is σ = 129558792. Its totient is φ = 123669672.
The previous prime is 126614227. The next prime is 126614237. The reversal of 126614231 is 132416621.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 126614231 - 22 = 126614227 is a prime.
It is a super-2 number, since 2×1266142312 = 32062326983442722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 126614231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126614237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1472216 + ... + 1472301.
It is an arithmetic number, because the mean of its divisors is an integer number (32389698).
Almost surely, 2126614231 is an apocalyptic number.
126614231 is a deficient number, since it is larger than the sum of its proper divisors (2944561).
126614231 is an equidigital number, since it uses as much as digits as its factorization.
126614231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2944560.
The product of its digits is 1728, while the sum is 26.
The square root of 126614231 is about 11252.2989206651. The cubic root of 126614231 is about 502.1431090431.
The spelling of 126614231 in words is "one hundred twenty-six million, six hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •