Base | Representation |
---|---|
bin | 1000001100110110… |
… | …1011110001011101 |
3 | 12200102022211110111 |
4 | 2003031223301131 |
5 | 14002024334321 |
6 | 1002235410021 |
7 | 105360416656 |
oct | 20315536135 |
9 | 5612284414 |
10 | 2201402461 |
11 | a2a6a8285 |
12 | 5152b3911 |
13 | 291102b0b |
14 | 16c52452d |
15 | cd3e75e1 |
hex | 8336bc5d |
2201402461 has 2 divisors, whose sum is σ = 2201402462. Its totient is φ = 2201402460.
The previous prime is 2201402459. The next prime is 2201402503. The reversal of 2201402461 is 1642041022.
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., 1280279961 + 921122500 = 35781^2 + 30350^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201402461 - 21 = 2201402459 is a prime.
Together with 2201402459, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201402261) 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, 1100701230 + 1100701231.
It is an arithmetic number, because the mean of its divisors is an integer number (1100701231).
Almost surely, 22201402461 is an apocalyptic number.
It is an amenable number.
2201402461 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201402461 is an equidigital number, since it uses as much as digits as its factorization.
2201402461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 2201402461 is about 46919.1055008511. The cubic root of 2201402461 is about 1300.8677561428.
Adding to 2201402461 its reverse (1642041022), we get a palindrome (3843443483).
The spelling of 2201402461 in words is "two billion, two hundred one million, four hundred two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •