Base | Representation |
---|---|
bin | 100101011111000110110… |
… | …1100110000111001110001 |
3 | 200020112022202001101022112 |
4 | 1022332031230300321301 |
5 | 1133402341014010001 |
6 | 14542452124015105 |
7 | 1041136300605254 |
oct | 112761554607161 |
9 | 20215282041275 |
10 | 5152043110001 |
11 | 1706a73027477 |
12 | 6b2600991495 |
13 | 2b4ab2a03048 |
14 | 13b50861509b |
15 | 8e03a87bcbb |
hex | 4af8db30e71 |
5152043110001 has 2 divisors, whose sum is σ = 5152043110002. Its totient is φ = 5152043110000.
The previous prime is 5152043109943. The next prime is 5152043110057. The reversal of 5152043110001 is 1000113402515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2653901646400 + 2498141463601 = 1629080^2 + 1580551^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152043110001 - 26 = 5152043109937 is a prime.
It is a super-3 number, since 3×51520431100013 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5152043110301) 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, 2576021555000 + 2576021555001.
It is an arithmetic number, because the mean of its divisors is an integer number (2576021555001).
Almost surely, 25152043110001 is an apocalyptic number.
It is an amenable number.
5152043110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5152043110001 is an equidigital number, since it uses as much as digits as its factorization.
5152043110001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 5152043110001 its reverse (1000113402515), we get a palindrome (6152156512516).
The spelling of 5152043110001 in words is "five trillion, one hundred fifty-two billion, forty-three million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •