Base | Representation |
---|---|
bin | 111010000011101… |
… | …1011110101000000 |
3 | 12000202201001002212 |
4 | 1310013123311000 |
5 | 12442203343143 |
6 | 521150401252 |
7 | 66163425320 |
oct | 16407336500 |
9 | 5022631085 |
10 | 1948106048 |
11 | 90a7229a9 |
12 | 464500228 |
13 | 2507a7b95 |
14 | 146a2b280 |
15 | b6061918 |
hex | 741dbd40 |
1948106048 has 56 divisors (see below), whose sum is σ = 4467758400. Its totient is φ = 825504768.
The previous prime is 1948106033. The next prime is 1948106051. The reversal of 1948106048 is 8406018491.
It is a tau number, because it is divible by the number of its divisors (56).
It is a junction number, because it is equal to n+sod(n) for n = 1948105996 and 1948106014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15443 + ... + 64301.
It is an arithmetic number, because the mean of its divisors is an integer number (79781400).
Almost surely, 21948106048 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 1948106048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2233879200).
1948106048 is an abundant number, since it is smaller than the sum of its proper divisors (2519652352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1948106048 is an equidigital number, since it uses as much as digits as its factorization.
1948106048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48967 (or 48957 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 41.
The square root of 1948106048 is about 44137.3543384739. The cubic root of 1948106048 is about 1248.9283717929.
The spelling of 1948106048 in words is "one billion, nine hundred forty-eight million, one hundred six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •