Base | Representation |
---|---|
bin | 111110111000100… |
… | …011001100101011 |
3 | 2201112012010212201 |
4 | 332320203030223 |
5 | 4130040333002 |
6 | 252404321031 |
7 | 35100310435 |
oct | 7670431453 |
9 | 2645163781 |
10 | 1055011627 |
11 | 4a158793a |
12 | 2553a3177 |
13 | 13a75b747 |
14 | a018b655 |
15 | 6294b087 |
hex | 3ee2332b |
1055011627 has 8 divisors (see below), whose sum is σ = 1074714480. Its totient is φ = 1035369600.
The previous prime is 1055011603. The next prime is 1055011669. The reversal of 1055011627 is 7261105501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055011627 is a prime.
It is a super-2 number, since 2×10550116272 = 2226099066210374258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1055011595 and 1055011604.
It is not an unprimeable number, because it can be changed into a prime (1055014627) 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 in 7 ways as a sum of consecutive naturals, for example, 20583 + ... + 50335.
It is an arithmetic number, because the mean of its divisors is an integer number (134339310).
Almost surely, 21055011627 is an apocalyptic number.
1055011627 is a deficient number, since it is larger than the sum of its proper divisors (19702853).
1055011627 is an equidigital number, since it uses as much as digits as its factorization.
1055011627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30413.
The product of its (nonzero) digits is 2100, while the sum is 28.
The square root of 1055011627 is about 32480.9425201917. The cubic root of 1055011627 is about 1018.0108700365.
The spelling of 1055011627 in words is "one billion, fifty-five million, eleven thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •