Base | Representation |
---|---|
bin | 1101110101111… |
… | …01111111001001 |
3 | 22002111120210222 |
4 | 12322331333021 |
5 | 214211342140 |
6 | 15304515425 |
7 | 2610005531 |
oct | 672757711 |
9 | 262446728 |
10 | 116121545 |
11 | 5a602921 |
12 | 32a7bb75 |
13 | 1b099797 |
14 | 115ca4c1 |
15 | a2db5b5 |
hex | 6ebdfc9 |
116121545 has 4 divisors (see below), whose sum is σ = 139345860. Its totient is φ = 92897232.
The previous prime is 116121527. The next prime is 116121563. The reversal of 116121545 is 545121611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 545121611 = 751 ⋅725861.
It is an interprime number because it is at equal distance from previous prime (116121527) and next prime (116121563).
It can be written as a sum of positive squares in 2 ways, for example, as 86918329 + 29203216 = 9323^2 + 5404^2 .
It is a cyclic number.
It is not a de Polignac number, because 116121545 - 28 = 116121289 is a prime.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11612150 + ... + 11612159.
It is an arithmetic number, because the mean of its divisors is an integer number (34836465).
Almost surely, 2116121545 is an apocalyptic number.
It is an amenable number.
116121545 is a deficient number, since it is larger than the sum of its proper divisors (23224315).
116121545 is an equidigital number, since it uses as much as digits as its factorization.
116121545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23224314.
The product of its digits is 1200, while the sum is 26.
The square root of 116121545 is about 10775.9707219350. The cubic root of 116121545 is about 487.8701742459.
The spelling of 116121545 in words is "one hundred sixteen million, one hundred twenty-one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •