Base | Representation |
---|---|
bin | 111100000110011110010… |
… | …111001000001010001001 |
3 | 112121211120012020122101002 |
4 | 330012132113020022021 |
5 | 1020131441312344223 |
6 | 12441203502304345 |
7 | 604251143310656 |
oct | 74063627101211 |
9 | 15554505218332 |
10 | 4130120434313 |
11 | 1352635349895 |
12 | 568540b880b5 |
13 | 23c612919a73 |
14 | 103c827d8c2d |
15 | 726796ace28 |
hex | 3c19e5c8289 |
4130120434313 has 2 divisors, whose sum is σ = 4130120434314. Its totient is φ = 4130120434312.
The previous prime is 4130120434283. The next prime is 4130120434327. The reversal of 4130120434313 is 3134340210314.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2420846592649 + 1709273841664 = 1555907^2 + 1307392^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4130120434313 is a prime.
It is not a weakly prime, because it can be changed into another prime (4130120434213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2065060217156 + 2065060217157.
It is an arithmetic number, because the mean of its divisors is an integer number (2065060217157).
Almost surely, 24130120434313 is an apocalyptic number.
It is an amenable number.
4130120434313 is a deficient number, since it is larger than the sum of its proper divisors (1).
4130120434313 is an equidigital number, since it uses as much as digits as its factorization.
4130120434313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 4130120434313 its reverse (3134340210314), we get a palindrome (7264460644627).
The spelling of 4130120434313 in words is "four trillion, one hundred thirty billion, one hundred twenty million, four hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •