Base | Representation |
---|---|
bin | 111110111011011… |
… | …000011100101011 |
3 | 2201120120212021000 |
4 | 332323120130223 |
5 | 4130233112102 |
6 | 252432250043 |
7 | 35106522036 |
oct | 7673303453 |
9 | 2646525230 |
10 | 1055754027 |
11 | 4a1a44699 |
12 | 2556a0923 |
13 | 13a95b633 |
14 | a030201d |
15 | 62a4601c |
hex | 3eed872b |
1055754027 has 16 divisors (see below), whose sum is σ = 1632084480. Its totient is φ = 673234056.
The previous prime is 1055754013. The next prime is 1055754061. The reversal of 1055754027 is 7204575501.
1055754027 is a `hidden beast` number, since 105 + 5 + 7 + 540 + 2 + 7 = 666.
It is not a de Polignac number, because 1055754027 - 211 = 1055751979 is a prime.
It is a super-2 number, since 2×10557540272 = 2229233131053433458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055753982 and 1055754000.
It is not an unprimeable number, because it can be changed into a prime (1055754727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 849423 + ... + 850664.
It is an arithmetic number, because the mean of its divisors is an integer number (102005280).
Almost surely, 21055754027 is an apocalyptic number.
1055754027 is a deficient number, since it is larger than the sum of its proper divisors (576330453).
1055754027 is a wasteful number, since it uses less digits than its factorization.
1055754027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700119 (or 1700113 counting only the distinct ones).
The product of its (nonzero) digits is 49000, while the sum is 36.
The square root of 1055754027 is about 32492.3687502158. The cubic root of 1055754027 is about 1018.2496017067.
The spelling of 1055754027 in words is "one billion, fifty-five million, seven hundred fifty-four thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •