Base | Representation |
---|---|
bin | 1101100110111… |
… | …11011101000101 |
3 | 21221211000002212 |
4 | 12303133131011 |
5 | 213211131402 |
6 | 15154513205 |
7 | 2554233203 |
oct | 663373505 |
9 | 257730085 |
10 | 114161477 |
11 | 59494231 |
12 | 32295805 |
13 | 1a861591 |
14 | 1123a073 |
15 | a050952 |
hex | 6cdf745 |
114161477 has 8 divisors (see below), whose sum is σ = 121987800. Its totient is φ = 106458624.
The previous prime is 114161471. The next prime is 114161479. The reversal of 114161477 is 774161411.
It can be written as a sum of positive squares in 4 ways, for example, as 17355556 + 96805921 = 4166^2 + 9839^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114161477 - 24 = 114161461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114161471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28952 + ... + 32657.
It is an arithmetic number, because the mean of its divisors is an integer number (15248475).
Almost surely, 2114161477 is an apocalyptic number.
114161477 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
114161477 is a deficient number, since it is larger than the sum of its proper divisors (7826323).
114161477 is a wasteful number, since it uses less digits than its factorization.
114161477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61735.
The product of its digits is 4704, while the sum is 32.
The square root of 114161477 is about 10684.6374295060. The cubic root of 114161477 is about 485.1095894347.
The spelling of 114161477 in words is "one hundred fourteen million, one hundred sixty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •