Base | Representation |
---|---|
bin | 1010100110100000… |
… | …10011101110000000 |
3 | 112200200000220221120 |
4 | 11103100103232000 |
5 | 43124042020141 |
6 | 2340441552240 |
7 | 261022042050 |
oct | 52320235600 |
9 | 15620026846 |
10 | 5691751296 |
11 | 2460932aa0 |
12 | 112a1a5680 |
13 | 6c927059a |
14 | 3bdccd560 |
15 | 234a49c66 |
hex | 153413b80 |
5691751296 has 128 divisors (see below), whose sum is σ = 18849404160. Its totient is φ = 1478369280.
The previous prime is 5691751291. The next prime is 5691751297. The reversal of 5691751296 is 6921571965.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5691751291) by changing a digit.
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, 66681 + ... + 125816.
It is an arithmetic number, because the mean of its divisors is an integer number (147260970).
Almost surely, 25691751296 is an apocalyptic number.
5691751296 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5691751296 is an abundant number, since it is smaller than the sum of its proper divisors (13157652864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5691751296 is a wasteful number, since it uses less digits than its factorization.
5691751296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192532 (or 192520 counting only the distinct ones).
The product of its digits is 1020600, while the sum is 51.
The square root of 5691751296 is about 75443.6961978932. The cubic root of 5691751296 is about 1785.4538879813.
The spelling of 5691751296 in words is "five billion, six hundred ninety-one million, seven hundred fifty-one thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.233 sec. • engine limits •