Base | Representation |
---|---|
bin | 1101111100001… |
… | …10101001100001 |
3 | 22011001100021011 |
4 | 12332012221201 |
5 | 214414142312 |
6 | 15334300521 |
7 | 2620001011 |
oct | 676065141 |
9 | 264040234 |
10 | 116943457 |
11 | 60014394 |
12 | 331b7741 |
13 | 1b2c6917 |
14 | 11761c41 |
15 | a3eeda7 |
hex | 6f86a61 |
116943457 has 4 divisors (see below), whose sum is σ = 120976020. Its totient is φ = 112910896.
The previous prime is 116943451. The next prime is 116943479. The reversal of 116943457 is 754349611.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38638656 + 78304801 = 6216^2 + 8849^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116943457 is a prime.
It is a super-2 number, since 2×1169434572 = 27351544270221698, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116943451) 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, 2016238 + ... + 2016295.
It is an arithmetic number, because the mean of its divisors is an integer number (30244005).
Almost surely, 2116943457 is an apocalyptic number.
It is an amenable number.
116943457 is a deficient number, since it is larger than the sum of its proper divisors (4032563).
116943457 is an equidigital number, since it uses as much as digits as its factorization.
116943457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4032562.
The product of its digits is 90720, while the sum is 40.
The square root of 116943457 is about 10814.0398094329. The cubic root of 116943457 is about 489.0185226959.
It can be divided in two parts, 11694 and 3457, that added together give a palindrome (15151).
The spelling of 116943457 in words is "one hundred sixteen million, nine hundred forty-three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •