Base | Representation |
---|---|
bin | 1001011111000000… |
… | …10010011011010111 |
3 | 111010212102101200221 |
4 | 10233200102123113 |
5 | 40412020214120 |
6 | 2201134215211 |
7 | 240116643664 |
oct | 45740223327 |
9 | 14125371627 |
10 | 5091960535 |
11 | 2183308352 |
12 | ba1354507 |
13 | 631c18ccc |
14 | 36439ca6b |
15 | 1ec06e0aa |
hex | 12f8126d7 |
5091960535 has 8 divisors (see below), whose sum is σ = 6275497536. Its totient is φ = 3963471840.
The previous prime is 5091960527. The next prime is 5091960611. The reversal of 5091960535 is 5350691905.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5091960535 - 23 = 5091960527 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5091960491 and 5091960500.
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 7 ways as a sum of consecutive naturals, for example, 13761871 + ... + 13762240.
It is an arithmetic number, because the mean of its divisors is an integer number (784437192).
Almost surely, 25091960535 is an apocalyptic number.
5091960535 is a deficient number, since it is larger than the sum of its proper divisors (1183537001).
5091960535 is a wasteful number, since it uses less digits than its factorization.
5091960535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27524153.
The product of its (nonzero) digits is 182250, while the sum is 43.
The square root of 5091960535 is about 71357.9745718725. The cubic root of 5091960535 is about 1720.3956786416.
The spelling of 5091960535 in words is "five billion, ninety-one million, nine hundred sixty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •