Base | Representation |
---|---|
bin | 1001000111000101… |
… | …01110000010001100 |
3 | 110121212210022211121 |
4 | 10203202232002030 |
5 | 40004131140213 |
6 | 2125204530324 |
7 | 232132056130 |
oct | 44342560214 |
9 | 13555708747 |
10 | 4891271308 |
11 | 208aaa4590 |
12 | b460b09a4 |
13 | 5cc4800a1 |
14 | 34587b3c0 |
15 | 1d962a88d |
hex | 1238ae08c |
4891271308 has 72 divisors (see below), whose sum is σ = 11263359744. Its totient is φ = 1805349600.
The previous prime is 4891271303. The next prime is 4891271311. The reversal of 4891271308 is 8031721984.
It is not an unprimeable number, because it can be changed into a prime (4891271303) 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 23 ways as a sum of consecutive naturals, for example, 89193 + ... + 133183.
It is an arithmetic number, because the mean of its divisors is an integer number (156435552).
Almost surely, 24891271308 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 4891271308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5631679872).
4891271308 is an abundant number, since it is smaller than the sum of its proper divisors (6372088436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4891271308 is a wasteful number, since it uses less digits than its factorization.
4891271308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44051 (or 44030 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 43.
The square root of 4891271308 is about 69937.6244091834. The cubic root of 4891271308 is about 1697.4901033387.
The spelling of 4891271308 in words is "four billion, eight hundred ninety-one million, two hundred seventy-one thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •