Base | Representation |
---|---|
bin | 111100001111000… |
… | …0000001000100111 |
3 | 12012212010002012222 |
4 | 1320132000020213 |
5 | 13114402141131 |
6 | 532315502555 |
7 | 101041220411 |
oct | 17036001047 |
9 | 5185102188 |
10 | 2021130791 |
11 | 94796a529 |
12 | 484a57a5b |
13 | 2629653a4 |
14 | 1525d99b1 |
15 | bc68887b |
hex | 78780227 |
2021130791 has 2 divisors, whose sum is σ = 2021130792. Its totient is φ = 2021130790.
The previous prime is 2021130781. The next prime is 2021130817. The reversal of 2021130791 is 1970311202.
It is an a-pointer prime, because the next prime (2021130817) can be obtained adding 2021130791 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2021130791 - 222 = 2016936487 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2021130791.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021130781) 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, 1010565395 + 1010565396.
It is an arithmetic number, because the mean of its divisors is an integer number (1010565396).
Almost surely, 22021130791 is an apocalyptic number.
2021130791 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021130791 is an equidigital number, since it uses as much as digits as its factorization.
2021130791 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 2021130791 is about 44956.9882331991. The cubic root of 2021130791 is about 1264.3427021597.
Adding to 2021130791 its reverse (1970311202), we get a palindrome (3991441993).
The spelling of 2021130791 in words is "two billion, twenty-one million, one hundred thirty thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •