Base | Representation |
---|---|
bin | 1011011010101101… |
… | …1110001001101000 |
3 | 21220121001110102221 |
4 | 2312223132021220 |
5 | 22234100132000 |
6 | 1224042203424 |
7 | 135643533553 |
oct | 26653361150 |
9 | 7817043387 |
10 | 3064849000 |
11 | 1333033464 |
12 | 7164b3574 |
13 | 39ac6b625 |
14 | 21108769a |
15 | 12e10361a |
hex | b6ade268 |
3064849000 has 64 divisors (see below), whose sum is σ = 7181375760. Its totient is φ = 1224294400.
The previous prime is 3064848989. The next prime is 3064849001. The reversal of 3064849000 is 9484603.
It can be written as a sum of positive squares in 8 ways, for example, as 1635555364 + 1429293636 = 40442^2 + 37806^2 .
It is not an unprimeable number, because it can be changed into a prime (3064849001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 975432 + ... + 978568.
Almost surely, 23064849000 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 3064849000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3590687880).
3064849000 is an abundant number, since it is smaller than the sum of its proper divisors (4116526760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3064849000 is a wasteful number, since it uses less digits than its factorization.
3064849000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4135 (or 4121 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 34.
The square root of 3064849000 is about 55361.0783854505. The cubic root of 3064849000 is about 1452.5676266032.
The spelling of 3064849000 in words is "three billion, sixty-four million, eight hundred forty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •