Base | Representation |
---|---|
bin | 1101110111000… |
… | …10001001101001 |
3 | 22002210010000012 |
4 | 12323202021221 |
5 | 214231112143 |
6 | 15312021305 |
7 | 2611163432 |
oct | 673421151 |
9 | 262703005 |
10 | 116269673 |
11 | 5a6a4143 |
12 | 32b31835 |
13 | 1b11c030 |
14 | 11628489 |
15 | a31a418 |
hex | 6ee2269 |
116269673 has 8 divisors (see below), whose sum is σ = 125338248. Its totient is φ = 107218944.
The previous prime is 116269663. The next prime is 116269687. The reversal of 116269673 is 376962611.
It can be written as a sum of positive squares in 4 ways, for example, as 29463184 + 86806489 = 5428^2 + 9317^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116269673 - 26 = 116269609 is a prime.
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 116269673.
It is not an unprimeable number, because it can be changed into a prime (116269633) 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, 11111 + ... + 18867.
It is an arithmetic number, because the mean of its divisors is an integer number (15667281).
Almost surely, 2116269673 is an apocalyptic number.
116269673 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
116269673 is a deficient number, since it is larger than the sum of its proper divisors (9068575).
116269673 is a wasteful number, since it uses less digits than its factorization.
116269673 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8923.
The product of its digits is 81648, while the sum is 41.
The square root of 116269673 is about 10782.8416013591. The cubic root of 116269673 is about 488.0775331996.
The spelling of 116269673 in words is "one hundred sixteen million, two hundred sixty-nine thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •