Base | Representation |
---|---|
bin | 100010100111101110100… |
… | …110110111001000000011 |
3 | 22102102220222011100111221 |
4 | 202213232212313020003 |
5 | 302434414220014423 |
6 | 5020541440015511 |
7 | 333612546002626 |
oct | 42475646671003 |
9 | 8372828140457 |
10 | 2379120079363 |
11 | 837a85296825 |
12 | 32510a601597 |
13 | 143472111991 |
14 | 83215959dbd |
15 | 41d46797e5d |
hex | 229ee9b7203 |
2379120079363 has 8 divisors (see below), whose sum is σ = 2381107276800. Its totient is φ = 2377133083008.
The previous prime is 2379120079331. The next prime is 2379120079367. The reversal of 2379120079363 is 3639700219732.
2379120079363 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2379120079363 - 25 = 2379120079331 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2379120079363.
It is not an unprimeable number, because it can be changed into a prime (2379120079367) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32031273 + ... + 32105461.
It is an arithmetic number, because the mean of its divisors is an integer number (297638409600).
Almost surely, 22379120079363 is an apocalyptic number.
2379120079363 is a deficient number, since it is larger than the sum of its proper divisors (1987197437).
2379120079363 is a wasteful number, since it uses less digits than its factorization.
2379120079363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100541.
The product of its (nonzero) digits is 2571912, while the sum is 52.
The spelling of 2379120079363 in words is "two trillion, three hundred seventy-nine billion, one hundred twenty million, seventy-nine thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •