Base | Representation |
---|---|
bin | 100100110000001001111… |
… | …0000011101110001000001 |
3 | 122212220001201102200201122 |
4 | 1021200103300131301001 |
5 | 1130224341012341113 |
6 | 14424254545042025 |
7 | 1030636524116126 |
oct | 111402360356101 |
9 | 18786051380648 |
10 | 5051213012033 |
11 | 16782310734a1 |
12 | 696b61026315 |
13 | 2a8434232c96 |
14 | 1366a123274d |
15 | 8b5d8822408 |
hex | 49813c1dc41 |
5051213012033 has 2 divisors, whose sum is σ = 5051213012034. Its totient is φ = 5051213012032.
The previous prime is 5051213011973. The next prime is 5051213012141. The reversal of 5051213012033 is 3302103121505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4701468514369 + 349744497664 = 2168287^2 + 591392^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051213012033 - 212 = 5051213007937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5051213011993 and 5051213012011.
It is not a weakly prime, because it can be changed into another prime (5051213012333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525606506016 + 2525606506017.
It is an arithmetic number, because the mean of its divisors is an integer number (2525606506017).
Almost surely, 25051213012033 is an apocalyptic number.
It is an amenable number.
5051213012033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051213012033 is an equidigital number, since it uses as much as digits as its factorization.
5051213012033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 5051213012033 its reverse (3302103121505), we get a palindrome (8353316133538).
The spelling of 5051213012033 in words is "five trillion, fifty-one billion, two hundred thirteen million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •