Base | Representation |
---|---|
bin | 1101111000111… |
… | …01101001001000 |
3 | 22010020111021100 |
4 | 12330131221020 |
5 | 214311411402 |
6 | 15321141400 |
7 | 2613230034 |
oct | 674355110 |
9 | 263214240 |
10 | 116513352 |
11 | 5a85022a |
12 | 3302a860 |
13 | 1b1a5c17 |
14 | 1168d1c4 |
15 | a36771c |
hex | 6f1da48 |
116513352 has 24 divisors (see below), whose sum is σ = 315557190. Its totient is φ = 38837760.
The previous prime is 116513347. The next prime is 116513363. The reversal of 116513352 is 253315611.
116513352 is a `hidden beast` number, since 1 + 1 + 651 + 3 + 3 + 5 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 116510436 + 2916 = 10794^2 + 54^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×1165133522 = 27150722388551808, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 809049 + ... + 809192.
Almost surely, 2116513352 is an apocalyptic number.
116513352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116513352 is an abundant number, since it is smaller than the sum of its proper divisors (199043838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116513352 is a wasteful number, since it uses less digits than its factorization.
116513352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1618253 (or 1618246 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 116513352 is about 10794.1350741965. The cubic root of 116513352 is about 488.4182676632.
Adding to 116513352 its reverse (253315611), we get a palindrome (369828963).
The spelling of 116513352 in words is "one hundred sixteen million, five hundred thirteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •