Base | Representation |
---|---|
bin | 101000101100001101110… |
… | …0000100001000111101101 |
3 | 201210122020120012022122120 |
4 | 1101120123200201013231 |
5 | 1213111424241202433 |
6 | 15521055123103153 |
7 | 1115021404361424 |
oct | 121303340410755 |
9 | 21718216168576 |
10 | 5592508928493 |
11 | 1866851548173 |
12 | 763a47b11ab9 |
13 | 3174a9a6b686 |
14 | 154970ba02bb |
15 | 9a719ac27b3 |
hex | 5161b8211ed |
5592508928493 has 8 divisors (see below), whose sum is σ = 7457193628800. Its totient is φ = 3728081756928.
The previous prime is 5592508928491. The next prime is 5592508928561. The reversal of 5592508928493 is 3948298052955.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5592508928493 - 21 = 5592508928491 is a prime.
It is a super-2 number, since 2×55925089284932 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5592508928491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64331508 + ... + 64418381.
It is an arithmetic number, because the mean of its divisors is an integer number (932149203600).
Almost surely, 25592508928493 is an apocalyptic number.
It is an amenable number.
5592508928493 is a deficient number, since it is larger than the sum of its proper divisors (1864684700307).
5592508928493 is a wasteful number, since it uses less digits than its factorization.
5592508928493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128764371.
The product of its (nonzero) digits is 279936000, while the sum is 69.
The spelling of 5592508928493 in words is "five trillion, five hundred ninety-two billion, five hundred eight million, nine hundred twenty-eight thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •