Base | Representation |
---|---|
bin | 1101110110000… |
… | …11101111101101 |
3 | 22002112210011121 |
4 | 12323003233231 |
5 | 214213121013 |
6 | 15305220541 |
7 | 2610134356 |
oct | 673035755 |
9 | 262483147 |
10 | 116145133 |
11 | 5a619615 |
12 | 32a91751 |
13 | 1b0a7440 |
14 | 115d4d2d |
15 | a2e358d |
hex | 6ec3bed |
116145133 has 8 divisors (see below), whose sum is σ = 125411328. Its totient is φ = 106926384.
The previous prime is 116145121. The next prime is 116145143. The reversal of 116145133 is 331541611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116145133 - 29 = 116144621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116145098 and 116145107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116145143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6685 + ... + 16642.
It is an arithmetic number, because the mean of its divisors is an integer number (15676416).
Almost surely, 2116145133 is an apocalyptic number.
116145133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
116145133 is a deficient number, since it is larger than the sum of its proper divisors (9266195).
116145133 is a wasteful number, since it uses less digits than its factorization.
116145133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23723.
The product of its digits is 1080, while the sum is 25.
The square root of 116145133 is about 10777.0651385245. The cubic root of 116145133 is about 487.9032060218.
Adding to 116145133 its reverse (331541611), we get a palindrome (447686744).
The spelling of 116145133 in words is "one hundred sixteen million, one hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •