Base | Representation |
---|---|
bin | 111100100010000… |
… | …0100110100100101 |
3 | 12020112220011010102 |
4 | 1321010010310211 |
5 | 13124431031321 |
6 | 533313433445 |
7 | 101222106521 |
oct | 17104046445 |
9 | 5215804112 |
10 | 2031111461 |
11 | 952567115 |
12 | 48826b885 |
13 | 264a4b202 |
14 | 153a76d81 |
15 | bd4aac0b |
hex | 79104d25 |
2031111461 has 2 divisors, whose sum is σ = 2031111462. Its totient is φ = 2031111460.
The previous prime is 2031111451. The next prime is 2031111463. The reversal of 2031111461 is 1641111302.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1829187361 + 201924100 = 42769^2 + 14210^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031111461 - 210 = 2031110437 is a prime.
Together with 2031111463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2031111463) 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, 1015555730 + 1015555731.
It is an arithmetic number, because the mean of its divisors is an integer number (1015555731).
Almost surely, 22031111461 is an apocalyptic number.
It is an amenable number.
2031111461 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031111461 is an equidigital number, since it uses as much as digits as its factorization.
2031111461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 2031111461 is about 45067.8539648828. The cubic root of 2031111461 is about 1266.4204618969.
Adding to 2031111461 its reverse (1641111302), we get a palindrome (3672222763).
The spelling of 2031111461 in words is "two billion, thirty-one million, one hundred eleven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •