Base | Representation |
---|---|
bin | 101001001101011110001… |
… | …0010001001010010110000 |
3 | 202001110120201120201212000 |
4 | 1102122330102021102300 |
5 | 1220244204444110032 |
6 | 20013545505534000 |
7 | 1123130234454522 |
oct | 122327422112260 |
9 | 22043521521760 |
10 | 5663925769392 |
11 | 189406a490830 |
12 | 775859344300 |
13 | 32114b8b0007 |
14 | 1581c7a2da12 |
15 | 9c4e97a2e7c |
hex | 526bc4894b0 |
5663925769392 has 80 divisors (see below), whose sum is σ = 17735525151360. Its totient is φ = 1716341140800.
The previous prime is 5663925769391. The next prime is 5663925769399. The reversal of 5663925769392 is 2939675293665.
5663925769392 is a `hidden beast` number, since 5 + 66 + 392 + 5 + 7 + 6 + 93 + 92 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a self number, because there is not a number n which added to its sum of digits gives 5663925769392.
It is not an unprimeable number, because it can be changed into a prime (5663925769391) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 595947034 + ... + 595956537.
It is an arithmetic number, because the mean of its divisors is an integer number (221694064392).
Almost surely, 25663925769392 is an apocalyptic number.
It is an amenable number.
5663925769392 is an abundant number, since it is smaller than the sum of its proper divisors (12071599381968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5663925769392 is a wasteful number, since it uses less digits than its factorization.
5663925769392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1191903599 (or 1191903587 counting only the distinct ones).
The product of its digits is 992023200, while the sum is 72.
The spelling of 5663925769392 in words is "five trillion, six hundred sixty-three billion, nine hundred twenty-five million, seven hundred sixty-nine thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •