Base | Representation |
---|---|
bin | 101101110001010011001… |
… | …101100101010101101101 |
3 | 102010200121012200100012011 |
4 | 231301103031211111231 |
5 | 403013044401133123 |
6 | 10404534134441221 |
7 | 443145523662055 |
oct | 55612315452555 |
9 | 12120535610164 |
10 | 3145312130413 |
11 | 1002a12777042 |
12 | 4296ba803211 |
13 | 19a7a8b07a1b |
14 | ac33bc36565 |
15 | 56c3b9c4e0d |
hex | 2dc5336556d |
3145312130413 has 2 divisors, whose sum is σ = 3145312130414. Its totient is φ = 3145312130412.
The previous prime is 3145312130377. The next prime is 3145312130417. The reversal of 3145312130413 is 3140312135413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2027667777444 + 1117644352969 = 1423962^2 + 1057187^2 .
It is a cyclic number.
It is not a de Polignac number, because 3145312130413 - 225 = 3145278575981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3145312130417) 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, 1572656065206 + 1572656065207.
It is an arithmetic number, because the mean of its divisors is an integer number (1572656065207).
Almost surely, 23145312130413 is an apocalyptic number.
It is an amenable number.
3145312130413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3145312130413 is an equidigital number, since it uses as much as digits as its factorization.
3145312130413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 3145312130413 its reverse (3140312135413), we get a palindrome (6285624265826).
The spelling of 3145312130413 in words is "three trillion, one hundred forty-five billion, three hundred twelve million, one hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •