Base | Representation |
---|---|
bin | 1011101010111… |
… | …1100011000000 |
3 | 10102010002121221 |
4 | 2322233203000 |
5 | 100013003121 |
6 | 4505124424 |
7 | 1133045452 |
oct | 272574300 |
9 | 112102557 |
10 | 48953536 |
11 | 256a6575 |
12 | 14489714 |
13 | a1accb8 |
14 | 67042d2 |
15 | 446eb41 |
hex | 2eaf8c0 |
48953536 has 14 divisors (see below), whose sum is σ = 97142300. Its totient is φ = 24476736.
The previous prime is 48953501. The next prime is 48953563. The reversal of 48953536 is 63535984.
48953536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 48953492 and 48953501.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 382386 + ... + 382513.
Almost surely, 248953536 is an apocalyptic number.
It is an amenable number.
48953536 is a deficient number, since it is larger than the sum of its proper divisors (48188764).
48953536 is an equidigital number, since it uses as much as digits as its factorization.
48953536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764911 (or 764901 counting only the distinct ones).
The product of its digits is 388800, while the sum is 43.
The square root of 48953536 is about 6996.6803557116. The cubic root of 48953536 is about 365.8148704915.
The spelling of 48953536 in words is "forty-eight million, nine hundred fifty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •