Base | Representation |
---|---|
bin | 1011000001010000… |
… | …00001010010010000 |
3 | 120021022010112210211 |
4 | 11200220001102100 |
5 | 44104003233211 |
6 | 2415013533504 |
7 | 266414526400 |
oct | 54050012220 |
9 | 16238115724 |
10 | 5916071056 |
11 | 2566516825 |
12 | 1191344294 |
13 | 73389127c |
14 | 401a02800 |
15 | 2495a9e21 |
hex | 160a01490 |
5916071056 has 135 divisors (see below), whose sum is σ = 13873973337. Its totient is φ = 2436698880.
The previous prime is 5916071053. The next prime is 5916071089. The reversal of 5916071056 is 6501706195.
The square root of 5916071056 is 76916.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 285069456 + 5631001600 = 16884^2 + 75040^2 .
It is not an unprimeable number, because it can be changed into a prime (5916071053) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 88299535 + ... + 88299601.
Almost surely, 25916071056 is an apocalyptic number.
5916071056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
5916071056 is the 76916-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5916071056
5916071056 is an abundant number, since it is smaller than the sum of its proper divisors (7957902281).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5916071056 is an equidigital number, since it uses as much as digits as its factorization.
5916071056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 40.
The cubic root of 5916071056 is about 1808.6080540886.
The spelling of 5916071056 in words is "five billion, nine hundred sixteen million, seventy-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •