Base | Representation |
---|---|
bin | 1101111000110… |
… | …11001010000001 |
3 | 22010012222022012 |
4 | 12330123022001 |
5 | 214311100134 |
6 | 15321022305 |
7 | 2613155246 |
oct | 674331201 |
9 | 263188265 |
10 | 116503169 |
11 | 5a843612 |
12 | 33024995 |
13 | 1b1a13b3 |
14 | 116895cd |
15 | a3646ce |
hex | 6f1b281 |
116503169 has 8 divisors (see below), whose sum is σ = 118861992. Its totient is φ = 114150400.
The previous prime is 116503141. The next prime is 116503183. The reversal of 116503169 is 961305611.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 102252544 + 14250625 = 10112^2 + 3775^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 116503169 - 28 = 116502913 is a prime.
It is a super-2 number, since 2×1165031692 = 27145976774085122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116503129) 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, 71969 + ... + 73569.
It is an arithmetic number, because the mean of its divisors is an integer number (14857749).
Almost surely, 2116503169 is an apocalyptic number.
It is an amenable number.
116503169 is a deficient number, since it is larger than the sum of its proper divisors (2358823).
116503169 is a wasteful number, since it uses less digits than its factorization.
116503169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3027.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 116503169 is about 10793.6633725534. The cubic root of 116503169 is about 488.4040383695.
The spelling of 116503169 in words is "one hundred sixteen million, five hundred three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •