Base | Representation |
---|---|
bin | 101000000111101011100… |
… | …0000010110001111110101 |
3 | 201112010201122022122102001 |
4 | 1100033113000112033311 |
5 | 1210320233324431313 |
6 | 15421041505015301 |
7 | 1106243206436065 |
oct | 120172700261765 |
9 | 21463648278361 |
10 | 5514050233333 |
11 | 183654a673244 |
12 | 7507b0324531 |
13 | 30cc8505b575 |
14 | 150c4a9db3a5 |
15 | 98676aabadd |
hex | 503d70163f5 |
5514050233333 has 2 divisors, whose sum is σ = 5514050233334. Its totient is φ = 5514050233332.
The previous prime is 5514050233243. The next prime is 5514050233337. The reversal of 5514050233333 is 3333320504155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4424026535569 + 1090023697764 = 2103337^2 + 1044042^2 .
It is a cyclic number.
It is not a de Polignac number, because 5514050233333 - 217 = 5514050102261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5514050233292 and 5514050233301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5514050233337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2757025116666 + 2757025116667.
It is an arithmetic number, because the mean of its divisors is an integer number (2757025116667).
Almost surely, 25514050233333 is an apocalyptic number.
It is an amenable number.
5514050233333 is a deficient number, since it is larger than the sum of its proper divisors (1).
5514050233333 is an equidigital number, since it uses as much as digits as its factorization.
5514050233333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 37.
Adding to 5514050233333 its reverse (3333320504155), we get a palindrome (8847370737488).
The spelling of 5514050233333 in words is "five trillion, five hundred fourteen billion, fifty million, two hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •