Base | Representation |
---|---|
bin | 1101110111101… |
… | …01011011010111 |
3 | 22002221010022120 |
4 | 12323311123113 |
5 | 214241124011 |
6 | 15313431023 |
7 | 2611642560 |
oct | 673653327 |
9 | 262833276 |
10 | 116348631 |
11 | 5a7484a3 |
12 | 32b6b473 |
13 | 1b148c59 |
14 | 11649167 |
15 | a333a06 |
hex | 6ef56d7 |
116348631 has 8 divisors (see below), whose sum is σ = 177293184. Its totient is φ = 66484920.
The previous prime is 116348627. The next prime is 116348657. The reversal of 116348631 is 136843611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116348631 - 22 = 116348627 is a prime.
It is a super-2 number, since 2×1163486312 = 27074007871148322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116348592 and 116348601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116348681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2770185 + ... + 2770226.
It is an arithmetic number, because the mean of its divisors is an integer number (22161648).
Almost surely, 2116348631 is an apocalyptic number.
116348631 is a deficient number, since it is larger than the sum of its proper divisors (60944553).
116348631 is an equidigital number, since it uses as much as digits as its factorization.
116348631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5540421.
The product of its digits is 10368, while the sum is 33.
The square root of 116348631 is about 10786.5022597689. The cubic root of 116348631 is about 488.1879916554.
It can be divided in two parts, 1163 and 48631, that added together give a palindrome (49794).
The spelling of 116348631 in words is "one hundred sixteen million, three hundred forty-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •