Base | Representation |
---|---|
bin | 1010100100001111… |
… | …01100100000111110 |
3 | 112122100012211220120 |
4 | 11102013230200332 |
5 | 43104203410400 |
6 | 2334521555410 |
7 | 260401202430 |
oct | 52207544076 |
9 | 15570184816 |
10 | 5672716350 |
11 | 2451111834 |
12 | 1123945b66 |
13 | 6c53374c2 |
14 | 3bb576650 |
15 | 233039ca0 |
hex | 1521ec83e |
5672716350 has 192 divisors, whose sum is σ = 16874729472. Its totient is φ = 1233792000.
The previous prime is 5672716337. The next prime is 5672716433. The reversal of 5672716350 is 536172765.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1984122 + ... + 1986978.
It is an arithmetic number, because the mean of its divisors is an integer number (87889216).
Almost surely, 25672716350 is an apocalyptic number.
5672716350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5672716350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8437364736).
5672716350 is an abundant number, since it is smaller than the sum of its proper divisors (11202013122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5672716350 is a wasteful number, since it uses less digits than its factorization.
5672716350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2971 (or 2966 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 42.
The square root of 5672716350 is about 75317.4372240585. The cubic root of 5672716350 is about 1783.4612982583.
The spelling of 5672716350 in words is "five billion, six hundred seventy-two million, seven hundred sixteen thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •