Base | Representation |
---|---|
bin | 1010000101010010… |
… | …01110110100001001 |
3 | 111222020122120000020 |
4 | 11002221032310021 |
5 | 42041221302022 |
6 | 2253044531053 |
7 | 251066232264 |
oct | 50251166411 |
9 | 14866576006 |
10 | 5413072137 |
11 | 23285a1240 |
12 | 10709b0a89 |
13 | 6835c9185 |
14 | 394ca9cdb |
15 | 21a34d35c |
hex | 142a4ed09 |
5413072137 has 8 divisors (see below), whose sum is σ = 7873559520. Its totient is φ = 3280649760.
The previous prime is 5413072097. The next prime is 5413072151. The reversal of 5413072137 is 7312703145.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5413072137 - 210 = 5413071113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 164032489 = 5413072137 / (5 + 4 + 1 + 3 + 0 + 7 + 2 + 1 + 3 + 7).
It is a junction number, because it is equal to n+sod(n) for n = 5413072098 and 5413072107.
It is not an unprimeable number, because it can be changed into a prime (5413072177) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82016212 + ... + 82016277.
It is an arithmetic number, because the mean of its divisors is an integer number (984194940).
Almost surely, 25413072137 is an apocalyptic number.
It is an amenable number.
5413072137 is a deficient number, since it is larger than the sum of its proper divisors (2460487383).
5413072137 is a wasteful number, since it uses less digits than its factorization.
5413072137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164032503.
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 5413072137 is about 73573.5831463984. The cubic root of 5413072137 is about 1755.8251747339.
The spelling of 5413072137 in words is "five billion, four hundred thirteen million, seventy-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •