Base | Representation |
---|---|
bin | 1011011101011… |
… | …0111100001000 |
3 | 10100110000120210 |
4 | 2313112330020 |
5 | 44301110222 |
6 | 4434121120 |
7 | 1122362010 |
oct | 267267410 |
9 | 110400523 |
10 | 48066312 |
11 | 2514aa28 |
12 | 141201a0 |
13 | 9c5c208 |
14 | 6552c40 |
15 | 4346d0c |
hex | 2dd6f08 |
48066312 has 64 divisors (see below), whose sum is σ = 138055680. Its totient is φ = 13660992.
The previous prime is 48066307. The next prime is 48066331. The reversal of 48066312 is 21366084.
It is a super-3 number, since 3×480663123 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48066312.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36823 + ... + 38105.
It is an arithmetic number, because the mean of its divisors is an integer number (2157120).
Almost surely, 248066312 is an apocalyptic number.
48066312 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48066312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69027840).
48066312 is an abundant number, since it is smaller than the sum of its proper divisors (89989368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48066312 is a wasteful number, since it uses less digits than its factorization.
48066312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1522 (or 1518 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 48066312 is about 6932.9872349515. The cubic root of 48066312 is about 363.5913983643.
The spelling of 48066312 in words is "forty-eight million, sixty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •