Base | Representation |
---|---|
bin | 11101001001101110101… |
… | …100111000110111100001 |
3 | 21002111220020222221121002 |
4 | 131021232230320313201 |
5 | 230310240334132321 |
6 | 4132150413041345 |
7 | 264506640134606 |
oct | 35115654706741 |
9 | 7074806887532 |
10 | 2003312020961 |
11 | 702666456199 |
12 | 284309186255 |
13 | 116bb07950a4 |
14 | 6cd646b86ad |
15 | 3719db5720b |
hex | 1d26eb38de1 |
2003312020961 has 2 divisors, whose sum is σ = 2003312020962. Its totient is φ = 2003312020960.
The previous prime is 2003312020951. The next prime is 2003312021033. The reversal of 2003312020961 is 1690202133002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1332510070336 + 670801950625 = 1154344^2 + 819025^2 .
It is a cyclic number.
It is not a de Polignac number, because 2003312020961 - 218 = 2003311758817 is a prime.
It is a super-2 number, since 2×20033120209612 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2003312020951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001656010480 + 1001656010481.
It is an arithmetic number, because the mean of its divisors is an integer number (1001656010481).
Almost surely, 22003312020961 is an apocalyptic number.
It is an amenable number.
2003312020961 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003312020961 is an equidigital number, since it uses as much as digits as its factorization.
2003312020961 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 29.
Adding to 2003312020961 its reverse (1690202133002), we get a palindrome (3693514153963).
The spelling of 2003312020961 in words is "two trillion, three billion, three hundred twelve million, twenty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •