Base | Representation |
---|---|
bin | 1101111000101… |
… | …00100010000101 |
3 | 22010011121002022 |
4 | 12330110202011 |
5 | 214304213122 |
6 | 15320252525 |
7 | 2613013166 |
oct | 674244205 |
9 | 263147068 |
10 | 116476037 |
11 | 5a825197 |
12 | 33011145 |
13 | 1b191c42 |
14 | 1167d76d |
15 | a35b642 |
hex | 6f14885 |
116476037 has 4 divisors (see below), whose sum is σ = 119624076. Its totient is φ = 113328000.
The previous prime is 116476013. The next prime is 116476043. The reversal of 116476037 is 730674611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 730674611 = 113 ⋅6466147.
It can be written as a sum of positive squares in 2 ways, for example, as 74666881 + 41809156 = 8641^2 + 6466^2 .
It is a cyclic number.
It is not a de Polignac number, because 116476037 - 26 = 116475973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116475988 and 116476006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116476067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1573964 + ... + 1574037.
It is an arithmetic number, because the mean of its divisors is an integer number (29906019).
Almost surely, 2116476037 is an apocalyptic number.
It is an amenable number.
116476037 is a deficient number, since it is larger than the sum of its proper divisors (3148039).
116476037 is an equidigital number, since it uses as much as digits as its factorization.
116476037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3148038.
The product of its (nonzero) digits is 21168, while the sum is 35.
The square root of 116476037 is about 10792.4064508338. The cubic root of 116476037 is about 488.3661212116.
The spelling of 116476037 in words is "one hundred sixteen million, four hundred seventy-six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •