Base | Representation |
---|---|
bin | 100000000111011111… |
… | …0011101001001000011 |
3 | 20121000200121002221101 |
4 | 1000032332131021003 |
5 | 2112223001330201 |
6 | 51403522035231 |
7 | 4661105350426 |
oct | 1001676351103 |
9 | 217020532841 |
10 | 68970730051 |
11 | 272831a7353 |
12 | 1144a1a8b17 |
13 | 667212c892 |
14 | 34a40499bd |
15 | 1bda09bd01 |
hex | 100ef9d243 |
68970730051 has 2 divisors, whose sum is σ = 68970730052. Its totient is φ = 68970730050.
The previous prime is 68970729979. The next prime is 68970730057. The reversal of 68970730051 is 15003707986.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 68970730051 - 29 = 68970729539 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 68970729983 and 68970730010.
It is not a weakly prime, because it can be changed into another prime (68970730057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34485365025 + 34485365026.
It is an arithmetic number, because the mean of its divisors is an integer number (34485365026).
Almost surely, 268970730051 is an apocalyptic number.
68970730051 is a deficient number, since it is larger than the sum of its proper divisors (1).
68970730051 is an equidigital number, since it uses as much as digits as its factorization.
68970730051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317520, while the sum is 46.
The spelling of 68970730051 in words is "sixty-eight billion, nine hundred seventy million, seven hundred thirty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.204 sec. • engine limits •