Base | Representation |
---|---|
bin | 1101101010101… |
… | …01000100111101 |
3 | 21222201110222201 |
4 | 12311111010331 |
5 | 213322041021 |
6 | 15213111501 |
7 | 2561310625 |
oct | 665250475 |
9 | 258643881 |
10 | 114643261 |
11 | 597931a7 |
12 | 32488591 |
13 | 1a99c965 |
14 | 11323885 |
15 | a0e8591 |
hex | 6d5513d |
114643261 has 4 divisors (see below), whose sum is σ = 114665724. Its totient is φ = 114620800.
The previous prime is 114643259. The next prime is 114643267. The reversal of 114643261 is 162346411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 162346411 = 31 ⋅5236981.
It can be written as a sum of positive squares in 2 ways, for example, as 11519236 + 103124025 = 3394^2 + 10155^2 .
It is a cyclic number.
It is not a de Polignac number, because 114643261 - 21 = 114643259 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 (114643267) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 531 + ... + 15151.
It is an arithmetic number, because the mean of its divisors is an integer number (28666431).
Almost surely, 2114643261 is an apocalyptic number.
It is an amenable number.
114643261 is a deficient number, since it is larger than the sum of its proper divisors (22463).
114643261 is an equidigital number, since it uses as much as digits as its factorization.
114643261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22462.
The product of its digits is 3456, while the sum is 28.
The square root of 114643261 is about 10707.1593338289. The cubic root of 114643261 is about 485.7910511516.
Adding to 114643261 its reverse (162346411), we get a palindrome (276989672).
The spelling of 114643261 in words is "one hundred fourteen million, six hundred forty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •