Base | Representation |
---|---|
bin | 1011000000110101… |
… | …01111011100111101 |
3 | 120021001120200220001 |
4 | 11200122233130331 |
5 | 44102110341031 |
6 | 2414411154301 |
7 | 266343121063 |
oct | 54032573475 |
9 | 16231520801 |
10 | 5912590141 |
11 | 2564559537 |
12 | 1190145991 |
13 | 732c42a63 |
14 | 401378033 |
15 | 24911d861 |
hex | 1606af73d |
5912590141 has 8 divisors (see below), whose sum is σ = 5940604800. Its totient is φ = 5884620720.
The previous prime is 5912590139. The next prime is 5912590147. The reversal of 5912590141 is 1410952195.
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 5912590141 - 21 = 5912590139 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 5912590141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5912590147) 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, 266680 + ... + 287998.
It is an arithmetic number, because the mean of its divisors is an integer number (742575600).
Almost surely, 25912590141 is an apocalyptic number.
It is an amenable number.
5912590141 is a deficient number, since it is larger than the sum of its proper divisors (28014659).
5912590141 is a wasteful number, since it uses less digits than its factorization.
5912590141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22619.
The product of its (nonzero) digits is 16200, while the sum is 37.
The square root of 5912590141 is about 76893.3686412554. The cubic root of 5912590141 is about 1808.2532664831.
The spelling of 5912590141 in words is "five billion, nine hundred twelve million, five hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •