Base | Representation |
---|---|
bin | 1101111001101… |
… | …11111110110011 |
3 | 22010102222021000 |
4 | 12330313332303 |
5 | 214323334420 |
6 | 15323333043 |
7 | 2614156413 |
oct | 674677663 |
9 | 263388230 |
10 | 116621235 |
11 | 5a914295 |
12 | 33081183 |
13 | 1b213063 |
14 | 116ba643 |
15 | a389690 |
hex | 6f37fb3 |
116621235 has 32 divisors (see below), whose sum is σ = 209364480. Its totient is φ = 61586784.
The previous prime is 116621213. The next prime is 116621237. The reversal of 116621235 is 532126611.
116621235 is a `hidden beast` number, since 1 + 1 + 6 + 621 + 2 + 35 = 666.
It is not a de Polignac number, because 116621235 - 212 = 116617139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 116621199 and 116621208.
It is not an unprimeable number, because it can be changed into a prime (116621237) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9712 + ... + 18098.
It is an arithmetic number, because the mean of its divisors is an integer number (6542640).
Almost surely, 2116621235 is an apocalyptic number.
116621235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116621235 is a deficient number, since it is larger than the sum of its proper divisors (92743245).
116621235 is a wasteful number, since it uses less digits than its factorization.
116621235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8504 (or 8498 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
The square root of 116621235 is about 10799.1312150561. The cubic root of 116621235 is about 488.5689679118.
Adding to 116621235 its reverse (532126611), we get a palindrome (648747846).
The spelling of 116621235 in words is "one hundred sixteen million, six hundred twenty-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •