Base | Representation |
---|---|
bin | 100000000111101010… |
… | …0111010100111100101 |
3 | 20121001002200020121222 |
4 | 1000033110322213211 |
5 | 2112231003233312 |
6 | 51404252150125 |
7 | 4661206402352 |
oct | 1001724724745 |
9 | 217032606558 |
10 | 68976617957 |
11 | 27286558a95 |
12 | 11450168345 |
13 | 6673411850 |
14 | 34a4b3d629 |
15 | 1bda861672 |
hex | 100f53a9e5 |
68976617957 has 4 divisors (see below), whose sum is σ = 74282511660. Its totient is φ = 63670724256.
The previous prime is 68976617951. The next prime is 68976617977. The reversal of 68976617957 is 75971667986.
It is a Cunningham number, because it is equal to 2626342+1.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75971667986 = 2 ⋅37985833993.
It can be written as a sum of positive squares in 2 ways, for example, as 10203828196 + 58772789761 = 101014^2 + 242431^2 .
It is a cyclic number.
It is not a de Polignac number, because 68976617957 - 212 = 68976613861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68976617951) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2652946832 + ... + 2652946857.
It is an arithmetic number, because the mean of its divisors is an integer number (18570627915).
Almost surely, 268976617957 is an apocalyptic number.
It is an amenable number.
68976617957 is a deficient number, since it is larger than the sum of its proper divisors (5305893703).
68976617957 is a wasteful number, since it uses less digits than its factorization.
68976617957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5305893702.
The product of its digits is 240045120, while the sum is 71.
The spelling of 68976617957 in words is "sixty-eight billion, nine hundred seventy-six million, six hundred seventeen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •