Base | Representation |
---|---|
bin | 1001101110011001… |
… | …11100010110000000 |
3 | 111110212102201110000 |
4 | 10313030330112000 |
5 | 41143100411242 |
6 | 2222030240000 |
7 | 243245451336 |
oct | 46714742600 |
9 | 14425381400 |
10 | 5221107072 |
11 | 223a1a7025 |
12 | 1018656000 |
13 | 6528c618c |
14 | 3775b9b56 |
15 | 20857ea4c |
hex | 13733c580 |
5221107072 has 160 divisors (see below), whose sum is σ = 15587205480. Its totient is φ = 1734856704.
The previous prime is 5221107061. The next prime is 5221107097. The reversal of 5221107072 is 2707011225.
5221107072 is a `hidden beast` number, since 522 + 1 + 1 + 0 + 70 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4488763 + ... + 4489925.
Almost surely, 25221107072 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 5221107072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7793602740).
5221107072 is an abundant number, since it is smaller than the sum of its proper divisors (10366098408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5221107072 is a wasteful number, since it uses less digits than its factorization.
5221107072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622 (or 1601 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 5221107072 is about 72257.2285103712. The cubic root of 5221107072 is about 1734.8191194689.
Adding to 5221107072 its reverse (2707011225), we get a palindrome (7928118297).
The spelling of 5221107072 in words is "five billion, two hundred twenty-one million, one hundred seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •