Base | Representation |
---|---|
bin | 111111100001011110… |
… | …111101011100110001 |
3 | 20112001111102221211210 |
4 | 333201132331130301 |
5 | 2104142104432212 |
6 | 51200055230333 |
7 | 4633150114245 |
oct | 774136753461 |
9 | 215044387753 |
10 | 68207499057 |
11 | 26a2139a635 |
12 | 112766783a9 |
13 | 657cc819c9 |
14 | 3430932425 |
15 | 1b9308953c |
hex | fe17bd731 |
68207499057 has 4 divisors (see below), whose sum is σ = 90943332080. Its totient is φ = 45471666036.
The previous prime is 68207498969. The next prime is 68207499091. The reversal of 68207499057 is 75099470286.
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.
It is not a de Polignac number, because 68207499057 - 223 = 68199110449 is a prime.
It is a super-2 number, since 2×682074990572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 68207498988 and 68207499006.
It is not an unprimeable number, because it can be changed into a prime (68207494057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11367916507 + ... + 11367916512.
It is an arithmetic number, because the mean of its divisors is an integer number (22735833020).
Almost surely, 268207499057 is an apocalyptic number.
It is an amenable number.
68207499057 is a deficient number, since it is larger than the sum of its proper divisors (22735833023).
68207499057 is a wasteful number, since it uses less digits than its factorization.
68207499057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22735833022.
The product of its (nonzero) digits is 7620480, while the sum is 57.
The spelling of 68207499057 in words is "sixty-eight billion, two hundred seven million, four hundred ninety-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •