Base | Representation |
---|---|
bin | 1101111010101… |
… | …01001000010111 |
3 | 22010200001001002 |
4 | 12331111020113 |
5 | 214341200011 |
6 | 15330053515 |
7 | 2615164460 |
oct | 675251027 |
9 | 263601032 |
10 | 116740631 |
11 | 5a995a67 |
12 | 3311a29b |
13 | 1b2554c7 |
14 | 1170bd67 |
15 | a3aec3b |
hex | 6f55217 |
116740631 has 8 divisors (see below), whose sum is σ = 138018720. Its totient is φ = 96612768.
The previous prime is 116740627. The next prime is 116740633. The reversal of 116740631 is 136047611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116740631 - 22 = 116740627 is a prime.
It is a super-2 number, since 2×1167406312 = 27256749852556322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 116740594 and 116740603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116740633) 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, 287336 + ... + 287741.
It is an arithmetic number, because the mean of its divisors is an integer number (17252340).
Almost surely, 2116740631 is an apocalyptic number.
116740631 is a deficient number, since it is larger than the sum of its proper divisors (21278089).
116740631 is an equidigital number, since it uses as much as digits as its factorization.
116740631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575113.
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 116740631 is about 10804.6578381733. The cubic root of 116740631 is about 488.7356422022.
The spelling of 116740631 in words is "one hundred sixteen million, seven hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •