Base | Representation |
---|---|
bin | 1000001100110… |
… | …01100011101101 |
3 | 11210102201012221 |
4 | 10012121203231 |
5 | 120102131123 |
6 | 10454155341 |
7 | 1463450323 |
oct | 406314355 |
9 | 153381187 |
10 | 68786413 |
11 | 35912283 |
12 | 1b052b51 |
13 | 11335327 |
14 | 91c7d13 |
15 | 608b25d |
hex | 41998ed |
68786413 has 2 divisors, whose sum is σ = 68786414. Its totient is φ = 68786412.
The previous prime is 68786411. The next prime is 68786423. The reversal of 68786413 is 31468786.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50098084 + 18688329 = 7078^2 + 4323^2 .
It is a cyclic number.
It is not a de Polignac number, because 68786413 - 21 = 68786411 is a prime.
It is a super-2 number, since 2×687864132 = 9463141226813138, which contains 22 as substring.
Together with 68786411, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 68786413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (68786411) 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 as a sum of consecutive naturals, namely, 34393206 + 34393207.
It is an arithmetic number, because the mean of its divisors is an integer number (34393207).
Almost surely, 268786413 is an apocalyptic number.
It is an amenable number.
68786413 is a deficient number, since it is larger than the sum of its proper divisors (1).
68786413 is an equidigital number, since it uses as much as digits as its factorization.
68786413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 193536, while the sum is 43.
The square root of 68786413 is about 8293.7574717374. The cubic root of 68786413 is about 409.7329472515.
The spelling of 68786413 in words is "sixty-eight million, seven hundred eighty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •