Base | Representation |
---|---|
bin | 1000000111110… |
… | …01101001100011 |
3 | 11202012102202012 |
4 | 10003321221203 |
5 | 114420201202 |
6 | 10432143135 |
7 | 1455051620 |
oct | 403715143 |
9 | 152172665 |
10 | 68131427 |
11 | 35505171 |
12 | 1a997aab |
13 | 11166170 |
14 | 9097347 |
15 | 5eac152 |
hex | 40f9a63 |
68131427 has 16 divisors (see below), whose sum is σ = 88788672. Its totient is φ = 50734080.
The previous prime is 68131421. The next prime is 68131433. The reversal of 68131427 is 72413186.
It is an interprime number because it is at equal distance from previous prime (68131421) and next prime (68131433).
It is a cyclic number.
It is not a de Polignac number, because 68131427 - 26 = 68131363 is a prime.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 68131393 and 68131402.
It is not an unprimeable number, because it can be changed into a prime (68131421) 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 15 ways as a sum of consecutive naturals, for example, 20474 + ... + 23567.
It is an arithmetic number, because the mean of its divisors is an integer number (5549292).
Almost surely, 268131427 is an apocalyptic number.
68131427 is a deficient number, since it is larger than the sum of its proper divisors (20657245).
68131427 is a wasteful number, since it uses less digits than its factorization.
68131427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44078.
The product of its digits is 8064, while the sum is 32.
The square root of 68131427 is about 8254.1763368612. The cubic root of 68131427 is about 408.4283015910.
The spelling of 68131427 in words is "sixty-eight million, one hundred thirty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •