Base | Representation |
---|---|
bin | 1011010111000111… |
… | …0111001000001000 |
3 | 21212112122012022211 |
4 | 2311301313020020 |
5 | 22221213400302 |
6 | 1222342354504 |
7 | 135401264350 |
oct | 26561671010 |
9 | 7775565284 |
10 | 3049746952 |
11 | 132555902a |
12 | 71142ba34 |
13 | 397ab16c5 |
14 | 20d075b60 |
15 | 12cb1dad7 |
hex | b5c77208 |
3049746952 has 128 divisors (see below), whose sum is σ = 6992697600. Its totient is φ = 1219276800.
The previous prime is 3049746929. The next prime is 3049746967. The reversal of 3049746952 is 2596479403.
It is a junction number, because it is equal to n+sod(n) for n = 3049746896 and 3049746905.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10853052 + ... + 10853332.
It is an arithmetic number, because the mean of its divisors is an integer number (54630450).
Almost surely, 23049746952 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 3049746952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3496348800).
3049746952 is an abundant number, since it is smaller than the sum of its proper divisors (3942950648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3049746952 is a wasteful number, since it uses less digits than its factorization.
3049746952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527 (or 523 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 49.
The square root of 3049746952 is about 55224.5140494690. The cubic root of 3049746952 is about 1450.1778540460.
The spelling of 3049746952 in words is "three billion, forty-nine million, seven hundred forty-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •