Base | Representation |
---|---|
bin | 1000011101010110… |
… | …10010100110000000 |
3 | 102201111001200201100 |
4 | 10032223102212000 |
5 | 33300021243142 |
6 | 2030341334400 |
7 | 220351351305 |
oct | 41653224600 |
9 | 12644050640 |
10 | 4541196672 |
11 | 1a20429301 |
12 | a68a07400 |
13 | 574a9bc2c |
14 | 3111910ac |
15 | 1b8a29b4c |
hex | 10ead2980 |
4541196672 has 192 divisors, whose sum is σ = 13894040160. Its totient is φ = 1418772480.
The previous prime is 4541196641. The next prime is 4541196683. The reversal of 4541196672 is 2766911454.
4541196672 is a `hidden beast` number, since 454 + 1 + 196 + 6 + 7 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is an unprimeable number.
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, 9027973 + ... + 9028475.
Almost surely, 24541196672 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 4541196672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6947020080).
4541196672 is an abundant number, since it is smaller than the sum of its proper divisors (9352843488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4541196672 is a wasteful number, since it uses less digits than its factorization.
4541196672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001 (or 986 counting only the distinct ones).
The product of its digits is 362880, while the sum is 45.
The square root of 4541196672 is about 67388.4016133340. The cubic root of 4541196672 is about 1655.9864173079.
The spelling of 4541196672 in words is "four billion, five hundred forty-one million, one hundred ninety-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •