Base | Representation |
---|---|
bin | 1000001100000… |
… | …11100011011001 |
3 | 11210021010120201 |
4 | 10012003203121 |
5 | 120041240111 |
6 | 10452222201 |
7 | 1462623463 |
oct | 406034331 |
9 | 153233521 |
10 | 68696281 |
11 | 35860595 |
12 | 1b00a961 |
13 | 113032b4 |
14 | 91a3133 |
15 | 606e6c1 |
hex | 41838d9 |
68696281 has 4 divisors (see below), whose sum is σ = 70157952. Its totient is φ = 67234612.
The previous prime is 68696213. The next prime is 68696293. The reversal of 68696281 is 18269686.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 18269686 = 2 ⋅9134843.
It is a cyclic number.
It is not a de Polignac number, because 68696281 - 29 = 68695769 is a prime.
It is a super-2 number, since 2×686962812 = 9438358046461922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (68696081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 730765 + ... + 730858.
It is an arithmetic number, because the mean of its divisors is an integer number (17539488).
Almost surely, 268696281 is an apocalyptic number.
It is an amenable number.
68696281 is a deficient number, since it is larger than the sum of its proper divisors (1461671).
68696281 is a wasteful number, since it uses less digits than its factorization.
68696281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461670.
The product of its digits is 248832, while the sum is 46.
The square root of 68696281 is about 8288.3219652714. The cubic root of 68696281 is about 409.5539090269.
The spelling of 68696281 in words is "sixty-eight million, six hundred ninety-six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •