Base | Representation |
---|---|
bin | 101101100101001011110… |
… | …011110001010100110001 |
3 | 102002110000120202010110101 |
4 | 231211023303301110301 |
5 | 402304424033140421 |
6 | 10354543220232401 |
7 | 442205250245323 |
oct | 55451363612461 |
9 | 12073016663411 |
10 | 3132303021361 |
11 | aa844743a948 |
12 | 427089b3b701 |
13 | 1994b4896b67 |
14 | ab8661b9613 |
15 | 56729874191 |
hex | 2d94bcf1531 |
3132303021361 has 2 divisors, whose sum is σ = 3132303021362. Its totient is φ = 3132303021360.
The previous prime is 3132303021359. The next prime is 3132303021409. The reversal of 3132303021361 is 1631203032313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2980802250000 + 151500771361 = 1726500^2 + 389231^2 .
It is a cyclic number.
It is not a de Polignac number, because 3132303021361 - 21 = 3132303021359 is a prime.
It is a super-2 number, since 2×31323030213612 (a number of 26 digits) contains 22 as substring.
Together with 3132303021359, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3132303021461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1566151510680 + 1566151510681.
It is an arithmetic number, because the mean of its divisors is an integer number (1566151510681).
Almost surely, 23132303021361 is an apocalyptic number.
It is an amenable number.
3132303021361 is a deficient number, since it is larger than the sum of its proper divisors (1).
3132303021361 is an equidigital number, since it uses as much as digits as its factorization.
3132303021361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 3132303021361 its reverse (1631203032313), we get a palindrome (4763506053674).
The spelling of 3132303021361 in words is "three trillion, one hundred thirty-two billion, three hundred three million, twenty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •