Base | Representation |
---|---|
bin | 1110010101100000… |
… | …0111110111000000 |
3 | 100221012021012120000 |
4 | 3211120013313000 |
5 | 30340131243422 |
6 | 1433510320000 |
7 | 164236030230 |
oct | 34530076700 |
9 | 10835235500 |
10 | 3848306112 |
11 | 16a52a5382 |
12 | 8b4959000 |
13 | 49437b811 |
14 | 287147cc0 |
15 | 177cadcac |
hex | e5607dc0 |
3848306112 has 280 divisors, whose sum is σ = 13133990496. Its totient is φ = 1091377152.
The previous prime is 3848306071. The next prime is 3848306129. The reversal of 3848306112 is 2116038483.
3848306112 is a `hidden beast` number, since 3 + 8 + 4 + 8 + 30 + 611 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6277518 + ... + 6278130.
Almost surely, 23848306112 is an apocalyptic number.
3848306112 is a gapful number since it is divisible by the number (32) 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 3848306112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6566995248).
3848306112 is an abundant number, since it is smaller than the sum of its proper divisors (9285684384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3848306112 is a wasteful number, since it uses less digits than its factorization.
3848306112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817 (or 798 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 3848306112 is about 62034.7169897631. The cubic root of 3848306112 is about 1567.0753172901.
The spelling of 3848306112 in words is "three billion, eight hundred forty-eight million, three hundred six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •