Base | Representation |
---|---|
bin | 101101101101100100001… |
… | …001001001011111100001 |
3 | 102010022020200102122002001 |
4 | 231231210021021133201 |
5 | 402431341102310103 |
6 | 10403032134524001 |
7 | 442644241515535 |
oct | 55554411113741 |
9 | 12108220378061 |
10 | 3141301213153 |
11 | 1001244706594 |
12 | 42897b506601 |
13 | 19a2b9b630bc |
14 | ac07b27dbc5 |
15 | 56aa47e501d |
hex | 2db642497e1 |
3141301213153 has 2 divisors, whose sum is σ = 3141301213154. Its totient is φ = 3141301213152.
The previous prime is 3141301213097. The next prime is 3141301213157. The reversal of 3141301213153 is 3513121031413.
It is a happy number.
3141301213153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2749385148129 + 391916065024 = 1658127^2 + 626032^2 .
It is a cyclic number.
It is not a de Polignac number, because 3141301213153 - 221 = 3141299116001 is a prime.
It is not a weakly prime, because it can be changed into another prime (3141301213157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570650606576 + 1570650606577.
It is an arithmetic number, because the mean of its divisors is an integer number (1570650606577).
Almost surely, 23141301213153 is an apocalyptic number.
It is an amenable number.
3141301213153 is a deficient number, since it is larger than the sum of its proper divisors (1).
3141301213153 is an equidigital number, since it uses as much as digits as its factorization.
3141301213153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 3141301213153 its reverse (3513121031413), we get a palindrome (6654422244566).
The spelling of 3141301213153 in words is "three trillion, one hundred forty-one billion, three hundred one million, two hundred thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •