Base | Representation |
---|---|
bin | 1101111100010… |
… | …10000110111111 |
3 | 22011002001201010 |
4 | 12332022012333 |
5 | 214420121011 |
6 | 15334450303 |
7 | 2620060230 |
oct | 676120677 |
9 | 264061633 |
10 | 116957631 |
11 | 60023aaa |
12 | 33203993 |
13 | 1b3001cb |
14 | 11767087 |
15 | a4041a6 |
hex | 6f8a1bf |
116957631 has 8 divisors (see below), whose sum is σ = 178221184. Its totient is φ = 66832920.
The previous prime is 116957623. The next prime is 116957651. The reversal of 116957631 is 136759611.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116957631 - 23 = 116957623 is a prime.
It is a super-2 number, since 2×1169576312 = 27358174898264322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116957631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116957611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2784685 + ... + 2784726.
It is an arithmetic number, because the mean of its divisors is an integer number (22277648).
Almost surely, 2116957631 is an apocalyptic number.
116957631 is a deficient number, since it is larger than the sum of its proper divisors (61263553).
116957631 is an equidigital number, since it uses as much as digits as its factorization.
116957631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5569421.
The product of its digits is 34020, while the sum is 39.
The square root of 116957631 is about 10814.6951413343. The cubic root of 116957631 is about 489.0382788775.
The spelling of 116957631 in words is "one hundred sixteen million, nine hundred fifty-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •