Base | Representation |
---|---|
bin | 11110101100001010001… |
… | …11011101110011110001 |
3 | 10201210211221101020211021 |
4 | 33112011013131303301 |
5 | 114234104040024403 |
6 | 2124233013215441 |
7 | 136120333531543 |
oct | 17260507356361 |
9 | 3653757336737 |
10 | 1054500314353 |
11 | 377235a33802 |
12 | 150452031581 |
13 | 785924c2165 |
14 | 39076725693 |
15 | 1c66b25c8bd |
hex | f5851ddcf1 |
1054500314353 has 2 divisors, whose sum is σ = 1054500314354. Its totient is φ = 1054500314352.
The previous prime is 1054500314333. The next prime is 1054500314447. The reversal of 1054500314353 is 3534130054501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 964828814049 + 89671500304 = 982257^2 + 299452^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054500314353 - 237 = 917061360881 is a prime.
It is a super-2 number, since 2×10545003143532 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1054500314323) 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, 527250157176 + 527250157177.
It is an arithmetic number, because the mean of its divisors is an integer number (527250157177).
Almost surely, 21054500314353 is an apocalyptic number.
It is an amenable number.
1054500314353 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054500314353 is an equidigital number, since it uses as much as digits as its factorization.
1054500314353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 1054500314353 its reverse (3534130054501), we get a palindrome (4588630368854).
The spelling of 1054500314353 in words is "one trillion, fifty-four billion, five hundred million, three hundred fourteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •