Base | Representation |
---|---|
bin | 1101100111011… |
… | …00111000001101 |
3 | 21221220210112022 |
4 | 12303230320031 |
5 | 213214411321 |
6 | 15200015525 |
7 | 2554552412 |
oct | 663547015 |
9 | 257823468 |
10 | 114216461 |
11 | 59521577 |
12 | 323015a5 |
13 | 1a880608 |
14 | 11252109 |
15 | a061dab |
hex | 6cece0d |
114216461 has 8 divisors (see below), whose sum is σ = 116337048. Its totient is φ = 112104000.
The previous prime is 114216449. The next prime is 114216469. The reversal of 114216461 is 164612411.
It can be written as a sum of positive squares in 4 ways, for example, as 1729225 + 112487236 = 1315^2 + 10606^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 114216461 - 214 = 114200077 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 114216461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114216469) 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, 31271 + ... + 34731.
It is an arithmetic number, because the mean of its divisors is an integer number (14542131).
Almost surely, 2114216461 is an apocalyptic number.
It is an amenable number.
114216461 is a deficient number, since it is larger than the sum of its proper divisors (2120587).
114216461 is an equidigital number, since it uses as much as digits as its factorization.
114216461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4063.
The product of its digits is 1152, while the sum is 26.
The square root of 114216461 is about 10687.2101598125. The cubic root of 114216461 is about 485.1874586228.
Adding to 114216461 its reverse (164612411), we get a palindrome (278828872).
The spelling of 114216461 in words is "one hundred fourteen million, two hundred sixteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •