Base | Representation |
---|---|
bin | 111100000110101001110… |
… | …110011111000110100101 |
3 | 112121212001121222100212001 |
4 | 330012221312133012211 |
5 | 1020132340140013013 |
6 | 12441234550125301 |
7 | 604256003653054 |
oct | 74065166370645 |
9 | 15555047870761 |
10 | 4130313204133 |
11 | 1352724143696 |
12 | 568595650831 |
13 | 23c64384214c |
14 | 103ca025839b |
15 | 7268b589ddd |
hex | 3c1a9d9f1a5 |
4130313204133 has 2 divisors, whose sum is σ = 4130313204134. Its totient is φ = 4130313204132.
The previous prime is 4130313204119. The next prime is 4130313204167. The reversal of 4130313204133 is 3314023130314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2235569213124 + 1894743991009 = 1495182^2 + 1376497^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4130313204133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4130313204113) 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, 2065156602066 + 2065156602067.
It is an arithmetic number, because the mean of its divisors is an integer number (2065156602067).
Almost surely, 24130313204133 is an apocalyptic number.
It is an amenable number.
4130313204133 is a deficient number, since it is larger than the sum of its proper divisors (1).
4130313204133 is an equidigital number, since it uses as much as digits as its factorization.
4130313204133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 4130313204133 its reverse (3314023130314), we get a palindrome (7444336334447).
The spelling of 4130313204133 in words is "four trillion, one hundred thirty billion, three hundred thirteen million, two hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •