Search a number
-
+
114621561 = 341415081
BaseRepresentation
bin1101101010011…
…11110001111001
321222200101020000
412311033301321
5213320342221
615212423213
72561160435
oct665176171
9258611200
10114621561
115977896a
1232477b09
131a992b12
14113199c5
15a0e1e26
hex6d4fc79

114621561 has 10 divisors (see below), whose sum is σ = 171224922. Its totient is φ = 76414320.

The previous prime is 114621557. The next prime is 114621569. The reversal of 114621561 is 165126411.

It can be written as a sum of positive squares in only one way, i.e., 113550336 + 1071225 = 10656^2 + 1035^2 .

It is not a de Polignac number, because 114621561 - 22 = 114621557 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is not an unprimeable number, because it can be changed into a prime (114621569) 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 9 ways as a sum of consecutive naturals, for example, 707460 + ... + 707621.

Almost surely, 2114621561 is an apocalyptic number.

It is an amenable number.

114621561 is a deficient number, since it is larger than the sum of its proper divisors (56603361).

114621561 is an equidigital number, since it uses as much as digits as its factorization.

114621561 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1415093 (or 1415084 counting only the distinct ones).

The product of its digits is 1440, while the sum is 27.

The square root of 114621561 is about 10706.1459452036. The cubic root of 114621561 is about 485.7603985838.

Adding to 114621561 its reverse (165126411), we get a palindrome (279747972).

The spelling of 114621561 in words is "one hundred fourteen million, six hundred twenty-one thousand, five hundred sixty-one".

Divisors: 1 3 9 27 81 1415081 4245243 12735729 38207187 114621561