Base | Representation |
---|---|
bin | 11101001110010100011… |
… | …11000010101111010101 |
3 | 10112222210212112102021211 |
4 | 32213022033002233111 |
5 | 112422414300232411 |
6 | 2045141515141421 |
7 | 132355015621441 |
oct | 16471217025725 |
9 | 3488725472254 |
10 | 1004120320981 |
11 | 357932820048 |
12 | 142731a44871 |
13 | 738c3ac72ab |
14 | 3685775b821 |
15 | 1b1bd357221 |
hex | e9ca3c2bd5 |
1004120320981 has 2 divisors, whose sum is σ = 1004120320982. Its totient is φ = 1004120320980.
The previous prime is 1004120320979. The next prime is 1004120321047. The reversal of 1004120320981 is 1890230214001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 862920234225 + 141200086756 = 928935^2 + 375766^2 .
It is a cyclic number.
It is not a de Polignac number, because 1004120320981 - 21 = 1004120320979 is a prime.
It is a super-2 number, since 2×10041203209812 (a number of 25 digits) contains 22 as substring.
Together with 1004120320979, 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 (1004120320921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502060160490 + 502060160491.
It is an arithmetic number, because the mean of its divisors is an integer number (502060160491).
Almost surely, 21004120320981 is an apocalyptic number.
It is an amenable number.
1004120320981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004120320981 is an equidigital number, since it uses as much as digits as its factorization.
1004120320981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 31.
Adding to 1004120320981 its reverse (1890230214001), we get a palindrome (2894350534982).
The spelling of 1004120320981 in words is "one trillion, four billion, one hundred twenty million, three hundred twenty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •