Base | Representation |
---|---|
bin | 11110101101101110101101… |
… | …01101111000110010100001 |
3 | 22212010221121112111200121001 |
4 | 33112313112231320302201 |
5 | 32323101420022123123 |
6 | 355352203253432001 |
7 | 20140513544413024 |
oct | 1726672655706241 |
9 | 285127545450531 |
10 | 67541963082913 |
11 | 1a580427388160 |
12 | 76aa10293b601 |
13 | 2b8c244cc6c57 |
14 | 1297096d691bb |
15 | 7c1dc4ddb0ad |
hex | 3d6dd6b78ca1 |
67541963082913 has 4 divisors (see below), whose sum is σ = 73682141545008. Its totient is φ = 61401784620820.
The previous prime is 67541963082787. The next prime is 67541963082917. The reversal of 67541963082913 is 31928036914576.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 67541963082913 - 29 = 67541963082401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67541963082917) 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, 3070089231031 + ... + 3070089231052.
It is an arithmetic number, because the mean of its divisors is an integer number (18420535386252).
It is a 1-persistent number, because it is pandigital, but 2⋅67541963082913 = 135083926165826 is not.
Almost surely, 267541963082913 is an apocalyptic number.
It is an amenable number.
67541963082913 is a deficient number, since it is larger than the sum of its proper divisors (6140178462095).
67541963082913 is a wasteful number, since it uses less digits than its factorization.
67541963082913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6140178462094.
The product of its (nonzero) digits is 58786560, while the sum is 64.
The spelling of 67541963082913 in words is "sixty-seven trillion, five hundred forty-one billion, nine hundred sixty-three million, eighty-two thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •