Base | Representation |
---|---|
bin | 1000001011100100… |
… | …00000000111010010 |
3 | 102100002020201220210 |
4 | 10011302000013102 |
5 | 32443320223132 |
6 | 2003450544550 |
7 | 213560024100 |
oct | 40562000722 |
9 | 12302221823 |
10 | 4391961042 |
11 | 1954169377 |
12 | a26a38156 |
13 | 54cba9c21 |
14 | 2d9424c70 |
15 | 1aa89bbcc |
hex | 105c801d2 |
4391961042 has 48 divisors (see below), whose sum is σ = 10263201120. Its totient is φ = 1249299072.
The previous prime is 4391961037. The next prime is 4391961071. The reversal of 4391961042 is 2401691934.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33834 + ... + 99642.
It is an arithmetic number, because the mean of its divisors is an integer number (213816690).
Almost surely, 24391961042 is an apocalyptic number.
4391961042 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 4391961042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5131600560).
4391961042 is an abundant number, since it is smaller than the sum of its proper divisors (5871240078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4391961042 is a wasteful number, since it uses less digits than its factorization.
4391961042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66055 (or 66048 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 39.
The square root of 4391961042 is about 66271.8721781722. The cubic root of 4391961042 is about 1637.6439798967.
The spelling of 4391961042 in words is "four billion, three hundred ninety-one million, nine hundred sixty-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •