Base | Representation |
---|---|
bin | 111110111000100… |
… | …100010110110101 |
3 | 2201112012101101111 |
4 | 332320210112311 |
5 | 4130041010443 |
6 | 252404355021 |
7 | 35100330325 |
oct | 7670442665 |
9 | 2645171344 |
10 | 1055016373 |
11 | 4a1590464 |
12 | 2553a5a71 |
13 | 13a760958 |
14 | a018d285 |
15 | 6294c69d |
hex | 3ee245b5 |
1055016373 has 2 divisors, whose sum is σ = 1055016374. Its totient is φ = 1055016372.
The previous prime is 1055016343. The next prime is 1055016419. The reversal of 1055016373 is 3736105501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 847857924 + 207158449 = 29118^2 + 14393^2 .
It is an emirp because it is prime and its reverse (3736105501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1055016373 - 225 = 1021461941 is a prime.
It is a super-2 number, since 2×10550163732 = 2226119094596150258, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055016343) 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, 527508186 + 527508187.
It is an arithmetic number, because the mean of its divisors is an integer number (527508187).
Almost surely, 21055016373 is an apocalyptic number.
It is an amenable number.
1055016373 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055016373 is an equidigital number, since it uses as much as digits as its factorization.
1055016373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 31.
The square root of 1055016373 is about 32481.0155783344. The cubic root of 1055016373 is about 1018.0123965512.
The spelling of 1055016373 in words is "one billion, fifty-five million, sixteen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.568 sec. • engine limits •