Base | Representation |
---|---|
bin | 1011011101011… |
… | …1001000011000 |
3 | 10100110001122211 |
4 | 2313113020120 |
5 | 44301121341 |
6 | 4434124504 |
7 | 1122364210 |
oct | 267271030 |
9 | 110401584 |
10 | 48067096 |
11 | 25150580 |
12 | 14120734 |
13 | 9c5c68c |
14 | 6553240 |
15 | 4347181 |
hex | 2dd7218 |
48067096 has 32 divisors (see below), whose sum is σ = 112366080. Its totient is φ = 18727200.
The previous prime is 48067051. The next prime is 48067099. The reversal of 48067096 is 69076084.
48067096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×480670963 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48067099) 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, 38400 + ... + 39631.
It is an arithmetic number, because the mean of its divisors is an integer number (3511440).
Almost surely, 248067096 is an apocalyptic number.
It is an amenable number.
48067096 is an abundant number, since it is smaller than the sum of its proper divisors (64298984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48067096 is a wasteful number, since it uses less digits than its factorization.
48067096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78055 (or 78051 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 40.
The square root of 48067096 is about 6933.0437760049. The cubic root of 48067096 is about 363.5933751758.
It can be divided in two parts, 480 and 67096, that added together give a palindrome (67576).
The spelling of 48067096 in words is "forty-eight million, sixty-seven thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •