Base | Representation |
---|---|
bin | 1011101110110100… |
… | …1000001100000000 |
3 | 22010110201101022000 |
4 | 2323231020030000 |
5 | 22422141410113 |
6 | 1240253344000 |
7 | 141016332630 |
oct | 27355101400 |
9 | 8113641260 |
10 | 3149169408 |
11 | 1376695650 |
12 | 73a798000 |
13 | 3b2582368 |
14 | 21c3566c0 |
15 | 13670c373 |
hex | bbb48300 |
3149169408 has 576 divisors, whose sum is σ = 11922570240. Its totient is φ = 796262400.
The previous prime is 3149169349. The next prime is 3149169409. The reversal of 3149169408 is 8049619413.
It is a tau number, because it is divible by the number of its divisors (576).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3149169409) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 32465616 + ... + 32465712.
Almost surely, 23149169408 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 3149169408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5961285120).
3149169408 is an abundant number, since it is smaller than the sum of its proper divisors (8773400832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3149169408 is a wasteful number, since it uses less digits than its factorization.
3149169408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201 (or 181 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 45.
The square root of 3149169408 is about 56117.4608121216. The cubic root of 3149169408 is about 1465.7683549602.
The spelling of 3149169408 in words is "three billion, one hundred forty-nine million, one hundred sixty-nine thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •