Base | Representation |
---|---|
bin | 101101101101011110000… |
… | …111001000011110100101 |
3 | 102010021222122000120002211 |
4 | 231231132013020132211 |
5 | 402431134201141123 |
6 | 10403014122003421 |
7 | 442641602431066 |
oct | 55553607103645 |
9 | 12107878016084 |
10 | 3141200021413 |
11 | 10011a2580753 |
12 | 428951646571 |
13 | 19a2a1bc302c |
14 | ac06ba5c56d |
15 | 56a9a9a740d |
hex | 2db5e1c87a5 |
3141200021413 has 2 divisors, whose sum is σ = 3141200021414. Its totient is φ = 3141200021412.
The previous prime is 3141200021359. The next prime is 3141200021437.
3141200021413 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2891417973889 + 249782047524 = 1700417^2 + 499782^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 3141200021413 - 217 = 3141199890341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3141200051413) 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, 1570600010706 + 1570600010707.
It is an arithmetic number, because the mean of its divisors is an integer number (1570600010707).
Almost surely, 23141200021413 is an apocalyptic number.
It is an amenable number.
3141200021413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3141200021413 is an equidigital number, since it uses as much as digits as its factorization.
3141200021413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
It can be divided in two parts, 31412000 and 21413, that added together give a palindrome (31433413).
The spelling of 3141200021413 in words is "three trillion, one hundred forty-one billion, two hundred million, twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •