Base | Representation |
---|---|
bin | 1011100101011… |
… | …1100011110001 |
3 | 10101102210020211 |
4 | 2321113203301 |
5 | 44414440022 |
6 | 4453304121 |
7 | 1130014645 |
oct | 271274361 |
9 | 111383224 |
10 | 48593137 |
11 | 2547a81a |
12 | 14335041 |
13 | a0b4c48 |
14 | 664cc25 |
15 | 43ece77 |
hex | 2e578f1 |
48593137 has 4 divisors (see below), whose sum is σ = 49208320. Its totient is φ = 47977956.
The previous prime is 48593131. The next prime is 48593141. The reversal of 48593137 is 73139584.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 48593137 - 219 = 48068849 is a prime.
It is a super-2 number, since 2×485931372 = 4722585927001538, which contains 22 as substring.
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 48593137.
It is not an unprimeable number, because it can be changed into a prime (48593131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 307473 + ... + 307630.
It is an arithmetic number, because the mean of its divisors is an integer number (12302080).
Almost surely, 248593137 is an apocalyptic number.
It is an amenable number.
48593137 is a deficient number, since it is larger than the sum of its proper divisors (615183).
48593137 is an equidigital number, since it uses as much as digits as its factorization.
48593137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615182.
The product of its digits is 90720, while the sum is 40.
The square root of 48593137 is about 6970.8777783002. The cubic root of 48593137 is about 364.9149410853.
The spelling of 48593137 in words is "forty-eight million, five hundred ninety-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •