Base | Representation |
---|---|
bin | 1101111000100… |
… | …11000101111101 |
3 | 22010011021222221 |
4 | 12330103011331 |
5 | 214304021031 |
6 | 15320205341 |
7 | 2612660044 |
oct | 674230575 |
9 | 263137887 |
10 | 116470141 |
11 | 5a820817 |
12 | 33009851 |
13 | 1b18c358 |
14 | 1167b55b |
15 | a359a11 |
hex | 6f1317d |
116470141 has 4 divisors (see below), whose sum is σ = 116523484. Its totient is φ = 116416800.
The previous prime is 116470129. The next prime is 116470163. The reversal of 116470141 is 141074611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141074611 = 491 ⋅287321.
It can be written as a sum of positive squares in 2 ways, for example, as 27092025 + 89378116 = 5205^2 + 9454^2 .
It is a cyclic number.
It is not a de Polignac number, because 116470141 - 219 = 115945853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116470121) 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, 23250 + ... + 27811.
It is an arithmetic number, because the mean of its divisors is an integer number (29130871).
Almost surely, 2116470141 is an apocalyptic number.
It is an amenable number.
116470141 is a deficient number, since it is larger than the sum of its proper divisors (53343).
116470141 is an equidigital number, since it uses as much as digits as its factorization.
116470141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53342.
The product of its (nonzero) digits is 672, while the sum is 25.
The square root of 116470141 is about 10792.1332923570. The cubic root of 116470141 is about 488.3578807319.
It can be divided in two parts, 116470 and 141, that added together give a palindrome (116611).
The spelling of 116470141 in words is "one hundred sixteen million, four hundred seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •