Base | Representation |
---|---|
bin | 1101111001010… |
… | …01111000111000 |
3 | 22010100001002010 |
4 | 12330221320320 |
5 | 214320013022 |
6 | 15322205520 |
7 | 2613526212 |
oct | 674517070 |
9 | 263301063 |
10 | 116563512 |
11 | 5a88498a |
12 | 330538a0 |
13 | 1b1c29c0 |
14 | 116a35b2 |
15 | a37750c |
hex | 6f29e38 |
116563512 has 64 divisors (see below), whose sum is σ = 314858880. Its totient is φ = 35747712.
The previous prime is 116563507. The next prime is 116563523. The reversal of 116563512 is 215365611.
It is a self number, because there is not a number n which added to its sum of digits gives 116563512.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170323 + ... + 171005.
It is an arithmetic number, because the mean of its divisors is an integer number (4919670).
Almost surely, 2116563512 is an apocalyptic number.
116563512 is a gapful number since it is divisible by the number (12) 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 116563512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157429440).
116563512 is an abundant number, since it is smaller than the sum of its proper divisors (198295368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116563512 is a wasteful number, since it uses less digits than its factorization.
116563512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252 (or 1248 counting only the distinct ones).
The product of its digits is 5400, while the sum is 30.
The square root of 116563512 is about 10796.4583081675. The cubic root of 116563512 is about 488.4883470291.
The spelling of 116563512 in words is "one hundred sixteen million, five hundred sixty-three thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •