Base | Representation |
---|---|
bin | 111100111000000… |
… | …100011010001001 |
3 | 2122011210222212002 |
4 | 330320010122021 |
5 | 4042430043311 |
6 | 245202400345 |
7 | 34211112431 |
oct | 7470043211 |
9 | 2564728762 |
10 | 1021331081 |
11 | 484573181 |
12 | 2460600b5 |
13 | 133798424 |
14 | 999012c1 |
15 | 5e9e693b |
hex | 3ce04689 |
1021331081 has 2 divisors, whose sum is σ = 1021331082. Its totient is φ = 1021331080.
The previous prime is 1021331029. The next prime is 1021331093. The reversal of 1021331081 is 1801331201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 715081081 + 306250000 = 26741^2 + 17500^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021331081 is a prime.
It is a super-2 number, since 2×10213310812 = 2086234354033257122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1021331011) 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, 510665540 + 510665541.
It is an arithmetic number, because the mean of its divisors is an integer number (510665541).
Almost surely, 21021331081 is an apocalyptic number.
It is an amenable number.
1021331081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021331081 is an equidigital number, since it uses as much as digits as its factorization.
1021331081 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 1021331081 is about 31958.2709325771. The cubic root of 1021331081 is about 1007.0603938537.
Adding to 1021331081 its reverse (1801331201), we get a palindrome (2822662282).
The spelling of 1021331081 in words is "one billion, twenty-one million, three hundred thirty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •