Base | Representation |
---|---|
bin | 1111100000100011… |
… | …1110011110000000 |
3 | 101202010121112010220 |
4 | 3320020332132000 |
5 | 32011223240332 |
6 | 1525033423040 |
7 | 205110534225 |
oct | 37010763600 |
9 | 11663545126 |
10 | 4163102592 |
11 | 1846a65660 |
12 | 98226aa80 |
13 | 51465a41c |
14 | 2b6c8d94c |
15 | 195741d2c |
hex | f823e780 |
4163102592 has 128 divisors (see below), whose sum is σ = 12453073920. Its totient is φ = 1220812800.
The previous prime is 4163102549. The next prime is 4163102611. The reversal of 4163102592 is 2952013614.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115048 + ... + 146840.
It is an arithmetic number, because the mean of its divisors is an integer number (97289640).
Almost surely, 24163102592 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 4163102592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6226536960).
4163102592 is an abundant number, since it is smaller than the sum of its proper divisors (8289971328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4163102592 is a wasteful number, since it uses less digits than its factorization.
4163102592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31852 (or 31840 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 4163102592 is about 64522.1093269586. The cubic root of 4163102592 is about 1608.6900332943.
The spelling of 4163102592 in words is "four billion, one hundred sixty-three million, one hundred two thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •