Base | Representation |
---|---|
bin | 1101111011111… |
… | …00000010000001 |
3 | 22010222010121111 |
4 | 12331330002001 |
5 | 214411244334 |
6 | 15333323321 |
7 | 2616430144 |
oct | 675740201 |
9 | 263863544 |
10 | 116899969 |
11 | 5aa9474a |
12 | 33196541 |
13 | 1b2acba4 |
14 | 1175005b |
15 | a3e2064 |
hex | 6f7c081 |
116899969 has 4 divisors (see below), whose sum is σ = 117934596. Its totient is φ = 115865344.
The previous prime is 116899949. The next prime is 116899999. The reversal of 116899969 is 969998611.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2131600 + 114768369 = 1460^2 + 10713^2 .
It is a cyclic number.
It is not a de Polignac number, because 116899969 - 221 = 114802817 is a prime.
It is a super-2 number, since 2×1168999692 = 27331205504401922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116899949) 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 3 ways as a sum of consecutive naturals, for example, 517144 + ... + 517369.
It is an arithmetic number, because the mean of its divisors is an integer number (29483649).
Almost surely, 2116899969 is an apocalyptic number.
It is an amenable number.
116899969 is a deficient number, since it is larger than the sum of its proper divisors (1034627).
116899969 is a wasteful number, since it uses less digits than its factorization.
116899969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034626.
The product of its digits is 1889568, while the sum is 58.
The square root of 116899969 is about 10812.0289030320. The cubic root of 116899969 is about 488.9578977445.
The spelling of 116899969 in words is "one hundred sixteen million, eight hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •