Base | Representation |
---|---|
bin | 101100101101011000000… |
… | …010000101110100110001 |
3 | 101212201100100022001221212 |
4 | 230231120002011310301 |
5 | 400314212402403133 |
6 | 10311233051125505 |
7 | 434654255602304 |
oct | 54553002056461 |
9 | 11781310261855 |
10 | 3072378559793 |
11 | a84a96666a44 |
12 | 417545443895 |
13 | 19395499738a |
14 | a89bd78ab3b |
15 | 54dbda93148 |
hex | 2cb58085d31 |
3072378559793 has 4 divisors (see below), whose sum is σ = 3072651647088. Its totient is φ = 3072105472500.
The previous prime is 3072378559721. The next prime is 3072378559837. The reversal of 3072378559793 is 3979558732703.
3072378559793 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3072378559793 - 228 = 3072110124337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3072378559703) 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, 136526771 + ... + 136549272.
It is an arithmetic number, because the mean of its divisors is an integer number (768162911772).
Almost surely, 23072378559793 is an apocalyptic number.
It is an amenable number.
3072378559793 is a deficient number, since it is larger than the sum of its proper divisors (273087295).
3072378559793 is a wasteful number, since it uses less digits than its factorization.
3072378559793 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273087294.
The product of its (nonzero) digits is 300056400, while the sum is 68.
The spelling of 3072378559793 in words is "three trillion, seventy-two billion, three hundred seventy-eight million, five hundred fifty-nine thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •