Base | Representation |
---|---|
bin | 1010011100000101… |
… | …10011011100001111 |
3 | 112110120112012210121 |
4 | 11032002303130033 |
5 | 42434201401020 |
6 | 2324040045411 |
7 | 255610656223 |
oct | 51602633417 |
9 | 15416465717 |
10 | 5604325135 |
11 | 241654a472 |
12 | 1104a63867 |
13 | 6b4110026 |
14 | 3b2452783 |
15 | 22c02abaa |
hex | 14e0b370f |
5604325135 has 4 divisors (see below), whose sum is σ = 6725190168. Its totient is φ = 4483460104.
The previous prime is 5604325093. The next prime is 5604325151. The reversal of 5604325135 is 5315234065.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5315234065 = 5 ⋅1063046813.
It is a cyclic number.
It is not a de Polignac number, because 5604325135 - 27 = 5604325007 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 5604325135.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560432509 + ... + 560432518.
It is an arithmetic number, because the mean of its divisors is an integer number (1681297542).
Almost surely, 25604325135 is an apocalyptic number.
5604325135 is a deficient number, since it is larger than the sum of its proper divisors (1120865033).
5604325135 is a wasteful number, since it uses less digits than its factorization.
5604325135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120865032.
The product of its (nonzero) digits is 54000, while the sum is 34.
The square root of 5604325135 is about 74862.0406815096. The cubic root of 5604325135 is about 1776.2650649635.
The spelling of 5604325135 in words is "five billion, six hundred four million, three hundred twenty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •