Base | Representation |
---|---|
bin | 11101001010101000110… |
… | …01010100000101001001 |
3 | 10112210201002102110001011 |
4 | 32211110121110011021 |
5 | 112404342141130321 |
6 | 2044213412523521 |
7 | 132255021342544 |
oct | 16452431240511 |
9 | 3483632373034 |
10 | 1002143301961 |
11 | 35700884a42a |
12 | 14227b9205a1 |
13 | 7366a338159 |
14 | 3670ad6585b |
15 | 1b1049d3ae1 |
hex | e954654149 |
1002143301961 has 2 divisors, whose sum is σ = 1002143301962. Its totient is φ = 1002143301960.
The previous prime is 1002143301941. The next prime is 1002143302003. The reversal of 1002143301961 is 1691033412001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1001210366025 + 932935936 = 1000605^2 + 30544^2 .
It is an emirp because it is prime and its reverse (1691033412001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1002143301961 - 29 = 1002143301449 is a prime.
It is not a weakly prime, because it can be changed into another prime (1002143301941) 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, 501071650980 + 501071650981.
It is an arithmetic number, because the mean of its divisors is an integer number (501071650981).
Almost surely, 21002143301961 is an apocalyptic number.
It is an amenable number.
1002143301961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002143301961 is an equidigital number, since it uses as much as digits as its factorization.
1002143301961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
Adding to 1002143301961 its reverse (1691033412001), we get a palindrome (2693176713962).
The spelling of 1002143301961 in words is "one trillion, two billion, one hundred forty-three million, three hundred one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •