Base | Representation |
---|---|
bin | 1011100101000001… |
… | …00101010111000000 |
3 | 121001012201011222210 |
4 | 11302200211113000 |
5 | 100212311032202 |
6 | 2504452502120 |
7 | 310020035130 |
oct | 56240452700 |
9 | 17035634883 |
10 | 6216111552 |
11 | 26aa918682 |
12 | 125591a940 |
13 | 780aa4621 |
14 | 42d7c6ac0 |
15 | 265ac5c6c |
hex | 1728255c0 |
6216111552 has 112 divisors (see below), whose sum is σ = 18819246080. Its totient is φ = 1773868032.
The previous prime is 6216111547. The next prime is 6216111619. The reversal of 6216111552 is 2551116126.
It is a tau number, because it is divible by the number of its divisors (112).
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 15 ways as a sum of consecutive naturals, for example, 1337649 + ... + 1342287.
Almost surely, 26216111552 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 6216111552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9409623040).
6216111552 is an abundant number, since it is smaller than the sum of its proper divisors (12603134528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6216111552 is a wasteful number, since it uses less digits than its factorization.
6216111552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5658 (or 5648 counting only the distinct ones).
The product of its digits is 3600, while the sum is 30.
The square root of 6216111552 is about 78842.3208182002. The cubic root of 6216111552 is about 1838.6804843362.
Adding to 6216111552 its reverse (2551116126), we get a palindrome (8767227678).
The spelling of 6216111552 in words is "six billion, two hundred sixteen million, one hundred eleven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •