Base | Representation |
---|---|
bin | 1101111001011… |
… | …00000111000000 |
3 | 22010100111120000 |
4 | 12330230013000 |
5 | 214320310413 |
6 | 15322320000 |
7 | 2613564555 |
oct | 674540700 |
9 | 263314500 |
10 | 116572608 |
11 | 5a8907a9 |
12 | 33059000 |
13 | 1b1c6b99 |
14 | 116a6a2c |
15 | a37a073 |
hex | 6f2c1c0 |
116572608 has 140 divisors (see below), whose sum is σ = 350367600. Its totient is φ = 38320128.
The previous prime is 116572601. The next prime is 116572627. The reversal of 116572608 is 806275611.
116572608 = 523 + 533 + ... + 1473.
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 (116572601) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 585693 + ... + 585891.
Almost surely, 2116572608 is an apocalyptic number.
116572608 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116572608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175183800).
116572608 is an abundant number, since it is smaller than the sum of its proper divisors (233794992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116572608 is a wasteful number, since it uses less digits than its factorization.
116572608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336 (or 317 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 116572608 is about 10796.8795492031. The cubic root of 116572608 is about 488.5010530476.
The spelling of 116572608 in words is "one hundred sixteen million, five hundred seventy-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •