Base | Representation |
---|---|
bin | 111000111101010011100… |
… | …001110001001011111101 |
3 | 111212012000111212022020002 |
4 | 320331103201301023331 |
5 | 1003112102320132210 |
6 | 12154041554004045 |
7 | 552533312611013 |
oct | 70752341611375 |
9 | 14765014768202 |
10 | 3914116567805 |
11 | 1279a70841934 |
12 | 5326b9876625 |
13 | 22513aabc7c2 |
14 | d763105a8b3 |
15 | 6bc3622c4a5 |
hex | 38f538712fd |
3914116567805 has 8 divisors (see below), whose sum is σ = 4823884202712. Its totient is φ = 3046663706688.
The previous prime is 3914116567783. The next prime is 3914116567811. The reversal of 3914116567805 is 5087656114193.
3914116567805 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1136447677849 + 2777668889956 = 1066043^2 + 1666634^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3914116567805 - 26 = 3914116567741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10578693242 + ... + 10578693611.
It is an arithmetic number, because the mean of its divisors is an integer number (602985525339).
Almost surely, 23914116567805 is an apocalyptic number.
It is an amenable number.
3914116567805 is a deficient number, since it is larger than the sum of its proper divisors (909767634907).
3914116567805 is a wasteful number, since it uses less digits than its factorization.
3914116567805 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21157386895.
The product of its (nonzero) digits is 5443200, while the sum is 56.
The spelling of 3914116567805 in words is "three trillion, nine hundred fourteen billion, one hundred sixteen million, five hundred sixty-seven thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •