Base | Representation |
---|---|
bin | 111100000010001011101… |
… | …000110011100010100101 |
3 | 112121101122222102002110001 |
4 | 330002023220303202211 |
5 | 1020043021400142203 |
6 | 12435122253301301 |
7 | 604026005513614 |
oct | 74021350634245 |
9 | 15541588362401 |
10 | 4125511334053 |
11 | 135068a66161a |
12 | 567675494831 |
13 | 23c059a645c5 |
14 | 10396660d87b |
15 | 724a9c1d91d |
hex | 3c08ba338a5 |
4125511334053 has 2 divisors, whose sum is σ = 4125511334054. Its totient is φ = 4125511334052.
The previous prime is 4125511334039. The next prime is 4125511334089. The reversal of 4125511334053 is 3504331155214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2209673331009 + 1915838003044 = 1486497^2 + 1384138^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4125511334053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4125511334093) 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, 2062755667026 + 2062755667027.
It is an arithmetic number, because the mean of its divisors is an integer number (2062755667027).
Almost surely, 24125511334053 is an apocalyptic number.
It is an amenable number.
4125511334053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4125511334053 is an equidigital number, since it uses as much as digits as its factorization.
4125511334053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 4125511334053 its reverse (3504331155214), we get a palindrome (7629842489267).
The spelling of 4125511334053 in words is "four trillion, one hundred twenty-five billion, five hundred eleven million, three hundred thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •