Base | Representation |
---|---|
bin | 1011100000010010… |
… | …1111010011000000 |
3 | 21222020002100122102 |
4 | 2320010233103000 |
5 | 22311043000143 |
6 | 1230235525532 |
7 | 136346456312 |
oct | 27004572300 |
9 | 7866070572 |
10 | 3088250048 |
11 | 1345266a74 |
12 | 7222b98a8 |
13 | 3a2a72ac0 |
14 | 2142197b2 |
15 | 1311c70b8 |
hex | b812f4c0 |
3088250048 has 56 divisors (see below), whose sum is σ = 6611002272. Its totient is φ = 1422895104.
The previous prime is 3088250003. The next prime is 3088250059. The reversal of 3088250048 is 8400528803.
It is a junction number, because it is equal to n+sod(n) for n = 3088249993 and 3088250020.
It is an unprimeable number.
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, 535436 + ... + 541172.
It is an arithmetic number, because the mean of its divisors is an integer number (118053612).
Almost surely, 23088250048 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 3088250048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3305501136).
3088250048 is an abundant number, since it is smaller than the sum of its proper divisors (3522752224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3088250048 is a wasteful number, since it uses less digits than its factorization.
3088250048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6409 (or 6399 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 38.
The square root of 3088250048 is about 55572.0257683666. The cubic root of 3088250048 is about 1456.2551881338.
The spelling of 3088250048 in words is "three billion, eighty-eight million, two hundred fifty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •