Base | Representation |
---|---|
bin | 111111010000111101… |
… | …110101111000011101 |
3 | 20111100011222221111122 |
4 | 333100331311320131 |
5 | 2103110134204403 |
6 | 51112355500325 |
7 | 4623243501335 |
oct | 772075657035 |
9 | 214304887448 |
10 | 67930381853 |
11 | 26899a25354 |
12 | 111b98b76a5 |
13 | 6537736529 |
14 | 3405bd80c5 |
15 | 1b78a9a838 |
hex | fd0f75e1d |
67930381853 has 2 divisors, whose sum is σ = 67930381854. Its totient is φ = 67930381852.
The previous prime is 67930381817. The next prime is 67930381861. The reversal of 67930381853 is 35818303976.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67528259044 + 402122809 = 259862^2 + 20053^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-67930381853 is a prime.
It is a super-2 number, since 2×679303818532 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 67930381795 and 67930381804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (67930381153) 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 as a sum of consecutive naturals, namely, 33965190926 + 33965190927.
It is an arithmetic number, because the mean of its divisors is an integer number (33965190927).
Almost surely, 267930381853 is an apocalyptic number.
It is an amenable number.
67930381853 is a deficient number, since it is larger than the sum of its proper divisors (1).
67930381853 is an equidigital number, since it uses as much as digits as its factorization.
67930381853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3265920, while the sum is 53.
The spelling of 67930381853 in words is "sixty-seven billion, nine hundred thirty million, three hundred eighty-one thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •