Base | Representation |
---|---|
bin | 1011100011110… |
… | …1001100100001 |
3 | 10101020022010102 |
4 | 2320331030201 |
5 | 44403011103 |
6 | 4451112145 |
7 | 1126055063 |
oct | 270751441 |
9 | 111208112 |
10 | 48485153 |
11 | 25406682 |
12 | 142a2655 |
13 | a077a52 |
14 | 6621733 |
15 | 43cae88 |
hex | 2e3d321 |
48485153 has 16 divisors (see below), whose sum is σ = 51114240. Its totient is φ = 45952896.
The previous prime is 48485141. The next prime is 48485161. The reversal of 48485153 is 35158484.
48485153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 48485153 - 24 = 48485137 is a prime.
It is a super-2 number, since 2×484851532 = 4701620122866818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48485113) 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 15 ways as a sum of consecutive naturals, for example, 280175 + ... + 280347.
It is an arithmetic number, because the mean of its divisors is an integer number (3194640).
Almost surely, 248485153 is an apocalyptic number.
It is an amenable number.
48485153 is a deficient number, since it is larger than the sum of its proper divisors (2629087).
48485153 is a wasteful number, since it uses less digits than its factorization.
48485153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376.
The product of its digits is 76800, while the sum is 38.
The square root of 48485153 is about 6963.1281045231. The cubic root of 48485153 is about 364.6444351237.
It can be divided in two parts, 4848 and 5153, that added together give a palindrome (10001).
The spelling of 48485153 in words is "forty-eight million, four hundred eighty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •