Base | Representation |
---|---|
bin | 1011100100101… |
… | …1000101010011 |
3 | 10101100012011011 |
4 | 2321023011103 |
5 | 44411321120 |
6 | 4452231351 |
7 | 1126412653 |
oct | 271130523 |
9 | 111305134 |
10 | 48542035 |
11 | 25445393 |
12 | 1430b557 |
13 | a0978c9 |
14 | 6638363 |
15 | 43dcc5a |
hex | 2e4b153 |
48542035 has 8 divisors (see below), whose sum is σ = 58292496. Its totient is φ = 38805600.
The previous prime is 48542033. The next prime is 48542047. The reversal of 48542035 is 53024584.
48542035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 48542035 - 21 = 48542033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48541988 and 48542006.
It is not an unprimeable number, because it can be changed into a prime (48542033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6952 + ... + 12058.
It is an arithmetic number, because the mean of its divisors is an integer number (7286562).
Almost surely, 248542035 is an apocalyptic number.
48542035 is a deficient number, since it is larger than the sum of its proper divisors (9750461).
48542035 is a wasteful number, since it uses less digits than its factorization.
48542035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7013.
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 48542035 is about 6967.2114220827. The cubic root of 48542035 is about 364.7869777199.
It can be divided in two parts, 4854 and 2035, that added together give a square (6889 = 832).
The spelling of 48542035 in words is "forty-eight million, five hundred forty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •