Base | Representation |
---|---|
bin | 101101101111001010100… |
… | …110100100110110010101 |
3 | 102010110200111000101101222 |
4 | 231233022212210312111 |
5 | 402443401133002123 |
6 | 10403514502500125 |
7 | 443034653633126 |
oct | 55571246446625 |
9 | 12113614011358 |
10 | 3143020203413 |
11 | 1001a46a6a3a2 |
12 | 42917b134645 |
13 | 19a50202b2bc |
14 | ac1a16aa04d |
15 | 56b5569a6c8 |
hex | 2dbca9a4d95 |
3143020203413 has 2 divisors, whose sum is σ = 3143020203414. Its totient is φ = 3143020203412.
The previous prime is 3143020203397. The next prime is 3143020203437.
3143020203413 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2616442121764 + 526578081649 = 1617542^2 + 725657^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 3143020203413 - 24 = 3143020203397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3143020203013) 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, 1571510101706 + 1571510101707.
It is an arithmetic number, because the mean of its divisors is an integer number (1571510101707).
Almost surely, 23143020203413 is an apocalyptic number.
It is an amenable number.
3143020203413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3143020203413 is an equidigital number, since it uses as much as digits as its factorization.
3143020203413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
It can be divided in two parts, 3143020 and 203413, that added together give a palindrome (3346433).
The spelling of 3143020203413 in words is "three trillion, one hundred forty-three billion, twenty million, two hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •