Base | Representation |
---|---|
bin | 1001101101111111… |
… | …11111111110111100 |
3 | 111110122001100011200 |
4 | 10312333333332330 |
5 | 41141213322413 |
6 | 2221425415500 |
7 | 243204560325 |
oct | 46677777674 |
9 | 14418040150 |
10 | 5217714108 |
11 | 2238299922 |
12 | 101749a590 |
13 | 651ca89c9 |
14 | 376d7544c |
15 | 20810e573 |
hex | 136ffffbc |
5217714108 has 144 divisors (see below), whose sum is σ = 14248241280. Its totient is φ = 1604873088.
The previous prime is 5217714091. The next prime is 5217714109. The reversal of 5217714108 is 8014177125.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5217714109) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5908635 + ... + 5909517.
It is an arithmetic number, because the mean of its divisors is an integer number (98946120).
Almost surely, 25217714108 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 5217714108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7124120640).
5217714108 is an abundant number, since it is smaller than the sum of its proper divisors (9030527172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5217714108 is a wasteful number, since it uses less digits than its factorization.
5217714108 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1128 (or 1123 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 36.
The square root of 5217714108 is about 72233.7463240001. The cubic root of 5217714108 is about 1734.4432442472.
The spelling of 5217714108 in words is "five billion, two hundred seventeen million, seven hundred fourteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •