Base | Representation |
---|---|
bin | 100100100011100… |
… | …1110110111010101 |
3 | 10011111010101200022 |
4 | 1021013032313111 |
5 | 10003004221121 |
6 | 321414554525 |
7 | 42253130342 |
oct | 11107166725 |
9 | 3144111608 |
10 | 1226632661 |
11 | 57a447301 |
12 | 2a2968a45 |
13 | 16718a857 |
14 | b8ca37c9 |
15 | 72a4baab |
hex | 491cedd5 |
1226632661 has 2 divisors, whose sum is σ = 1226632662. Its totient is φ = 1226632660.
The previous prime is 1226632643. The next prime is 1226632697. The reversal of 1226632661 is 1662366221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1132659025 + 93973636 = 33655^2 + 9694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1226632661 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1226632261) 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 as a sum of consecutive naturals, namely, 613316330 + 613316331.
It is an arithmetic number, because the mean of its divisors is an integer number (613316331).
Almost surely, 21226632661 is an apocalyptic number.
It is an amenable number.
1226632661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1226632661 is an equidigital number, since it uses as much as digits as its factorization.
1226632661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 35.
The square root of 1226632661 is about 35023.3159623700. The cubic root of 1226632661 is about 1070.4626237792.
Adding to 1226632661 its reverse (1662366221), we get a palindrome (2888998882).
The spelling of 1226632661 in words is "one billion, two hundred twenty-six million, six hundred thirty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •