Base | Representation |
---|---|
bin | 1101111010010… |
… | …01000101110000 |
3 | 22010120112101110 |
4 | 12331021011300 |
5 | 214333110222 |
6 | 15325033320 |
7 | 2614600623 |
oct | 675110560 |
9 | 263515343 |
10 | 116691312 |
11 | 5a961a01 |
12 | 330b5840 |
13 | 1b238c1a |
14 | 116d7dba |
15 | a3a030c |
hex | 6f49170 |
116691312 has 40 divisors (see below), whose sum is σ = 317320960. Its totient is φ = 36849600.
The previous prime is 116691299. The next prime is 116691313. The reversal of 116691312 is 213196611.
It is a self number, because there is not a number n which added to its sum of digits gives 116691312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116691313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63064 + ... + 64887.
It is an arithmetic number, because the mean of its divisors is an integer number (7933024).
Almost surely, 2116691312 is an apocalyptic number.
116691312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116691312 is an abundant number, since it is smaller than the sum of its proper divisors (200629648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116691312 is a wasteful number, since it uses less digits than its factorization.
116691312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127981 (or 127975 counting only the distinct ones).
The product of its digits is 1944, while the sum is 30.
The square root of 116691312 is about 10802.3752943508. The cubic root of 116691312 is about 488.6668077039. Note that the first 3 decimals are identical.
The spelling of 116691312 in words is "one hundred sixteen million, six hundred ninety-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •