Base | Representation |
---|---|
bin | 100100101110000… |
… | …1001001010100101 |
3 | 10011212102220010111 |
4 | 1021130021022211 |
5 | 10010410124331 |
6 | 322132253021 |
7 | 42350541043 |
oct | 11134111245 |
9 | 3155386114 |
10 | 1232114341 |
11 | 582550817 |
12 | 2a4771171 |
13 | 168359953 |
14 | b98cd393 |
15 | 73280db1 |
hex | 497092a5 |
1232114341 has 2 divisors, whose sum is σ = 1232114342. Its totient is φ = 1232114340.
The previous prime is 1232114297. The next prime is 1232114357. The reversal of 1232114341 is 1434112321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 954192100 + 277922241 = 30890^2 + 16671^2 .
It is a cyclic number.
It is not a de Polignac number, because 1232114341 - 29 = 1232113829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1232114141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616057170 + 616057171.
It is an arithmetic number, because the mean of its divisors is an integer number (616057171).
Almost surely, 21232114341 is an apocalyptic number.
It is an amenable number.
1232114341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1232114341 is an equidigital number, since it uses as much as digits as its factorization.
1232114341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 22.
The square root of 1232114341 is about 35101.4863075625. The cubic root of 1232114341 is about 1072.0548456777.
Adding to 1232114341 its reverse (1434112321), we get a palindrome (2666226662).
It can be divided in two parts, 12321 and 14341, that added together give a palindrome (26662).
The spelling of 1232114341 in words is "one billion, two hundred thirty-two million, one hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •