Base | Representation |
---|---|
bin | 1011100100011… |
… | …0111101001011 |
3 | 10101022022222002 |
4 | 2321012331023 |
5 | 44410301011 |
6 | 4452021215 |
7 | 1126312454 |
oct | 271067513 |
9 | 111268862 |
10 | 48525131 |
11 | 25433716 |
12 | 1430180b |
13 | a08ccc5 |
14 | 663212b |
15 | 43d7c3b |
hex | 2e46f4b |
48525131 has 4 divisors (see below), whose sum is σ = 48539064. Its totient is φ = 48511200.
The previous prime is 48525119. The next prime is 48525133. The reversal of 48525131 is 13152584.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 48525131 - 210 = 48524107 is a prime.
It is a super-2 number, since 2×485251312 = 4709376677134322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48525094 and 48525103.
It is not an unprimeable number, because it can be changed into a prime (48525133) 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, 3476 + ... + 10446.
It is an arithmetic number, because the mean of its divisors is an integer number (12134766).
Almost surely, 248525131 is an apocalyptic number.
48525131 is a deficient number, since it is larger than the sum of its proper divisors (13933).
48525131 is an equidigital number, since it uses as much as digits as its factorization.
48525131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13932.
The product of its digits is 4800, while the sum is 29.
The square root of 48525131 is about 6965.9982055697. The cubic root of 48525131 is about 364.7446290285.
The spelling of 48525131 in words is "forty-eight million, five hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •