Base | Representation |
---|---|
bin | 1011100101011… |
… | …0111101101000 |
3 | 10101102122220102 |
4 | 2321112331220 |
5 | 44414400241 |
6 | 4453244532 |
7 | 1130004560 |
oct | 271267550 |
9 | 111378812 |
10 | 48590696 |
11 | 25478a00 |
12 | 14333748 |
13 | a0b3abb |
14 | 664bda0 |
15 | 43ec39b |
hex | 2e56f68 |
48590696 has 96 divisors (see below), whose sum is σ = 117210240. Its totient is φ = 18480000.
The previous prime is 48590693. The next prime is 48590701. The reversal of 48590696 is 69609584.
It is a super-2 number, since 2×485906962 = 4722111475528832, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48590696.
It is not an unprimeable number, because it can be changed into a prime (48590693) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 481046 + ... + 481146.
It is an arithmetic number, because the mean of its divisors is an integer number (1220940).
Almost surely, 248590696 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48590696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58605120).
48590696 is an abundant number, since it is smaller than the sum of its proper divisors (68619544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48590696 is a wasteful number, since it uses less digits than its factorization.
48590696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 47.
The square root of 48590696 is about 6970.7026905471. The cubic root of 48590696 is about 364.9088306731.
The spelling of 48590696 in words is "forty-eight million, five hundred ninety thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •