Base | Representation |
---|---|
bin | 111111010011010011… |
… | …010110000101011101 |
3 | 20111102220202001221111 |
4 | 333103103112011131 |
5 | 2103200202320323 |
6 | 51120315502021 |
7 | 4624230561013 |
oct | 772323260535 |
9 | 214386661844 |
10 | 67969573213 |
11 | 2690a063403 |
12 | 1120aa57911 |
13 | 65428a8c99 |
14 | 340b0ba8b3 |
15 | 1b7c23cc0d |
hex | fd34d615d |
67969573213 has 4 divisors (see below), whose sum is σ = 71967783420. Its totient is φ = 63971363008.
The previous prime is 67969573201. The next prime is 67969573237. The reversal of 67969573213 is 31237596976.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40081241209 + 27888332004 = 200203^2 + 166998^2 .
It is a cyclic number.
It is not a de Polignac number, because 67969573213 - 221 = 67967476061 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67969573313) 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, 1999105078 + ... + 1999105111.
It is an arithmetic number, because the mean of its divisors is an integer number (17991945855).
Almost surely, 267969573213 is an apocalyptic number.
It is an amenable number.
67969573213 is a deficient number, since it is larger than the sum of its proper divisors (3998210207).
67969573213 is a wasteful number, since it uses less digits than its factorization.
67969573213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3998210206.
The product of its digits is 12859560, while the sum is 58.
The spelling of 67969573213 in words is "sixty-seven billion, nine hundred sixty-nine million, five hundred seventy-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •