Base | Representation |
---|---|
bin | 11110111010001100110101… |
… | …01100001000110010110001 |
3 | 22220122220121201100121200002 |
4 | 33131012122230020302301 |
5 | 32402111441344031232 |
6 | 400321110033435345 |
7 | 20213463116266613 |
oct | 1735063254106261 |
9 | 286586551317602 |
10 | 67970452720817 |
11 | 1a72611a636149 |
12 | 775916710bb55 |
13 | 2bc0780b1a7aa |
14 | 12adb04b36db3 |
15 | 7cd102a18b62 |
hex | 3dd19ab08cb1 |
67970452720817 has 16 divisors (see below), whose sum is σ = 68463680699520. Its totient is φ = 67478186063232.
The previous prime is 67970452720813. The next prime is 67970452720831. The reversal of 67970452720817 is 71802725407976.
67970452720817 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 67970452720817 - 22 = 67970452720813 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67970452720813) 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 15 ways as a sum of consecutive naturals, for example, 732480659 + ... + 732573447.
It is an arithmetic number, because the mean of its divisors is an integer number (4278980043720).
Almost surely, 267970452720817 is an apocalyptic number.
It is an amenable number.
67970452720817 is a deficient number, since it is larger than the sum of its proper divisors (493227978703).
67970452720817 is a wasteful number, since it uses less digits than its factorization.
67970452720817 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97912.
The product of its (nonzero) digits is 82978560, while the sum is 65.
The spelling of 67970452720817 in words is "sixty-seven trillion, nine hundred seventy billion, four hundred fifty-two million, seven hundred twenty thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •