Base | Representation |
---|---|
bin | 111110101001011… |
… | …101001111001111 |
3 | 2201020202010111000 |
4 | 332221131033033 |
5 | 4123032230210 |
6 | 252143431343 |
7 | 35021551311 |
oct | 7651351717 |
9 | 2636663430 |
10 | 1051055055 |
11 | 49a325246 |
12 | 253bb5553 |
13 | 1399a488b |
14 | 9d83b7b1 |
15 | 62418ac0 |
hex | 3ea5d3cf |
1051055055 has 16 divisors (see below), whose sum is σ = 1868542560. Its totient is φ = 560562624.
The previous prime is 1051055021. The next prime is 1051055119. The reversal of 1051055055 is 5505501501.
1051055055 is a `hidden beast` number, since 10 + 51 + 0 + 550 + 55 = 666.
It is not a de Polignac number, because 1051055055 - 223 = 1042666447 is a prime.
It is a super-2 number, since 2×10510550552 = 2209433457282106050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3892662 + ... + 3892931.
It is an arithmetic number, because the mean of its divisors is an integer number (116783910).
Almost surely, 21051055055 is an apocalyptic number.
1051055055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1051055055 is a deficient number, since it is larger than the sum of its proper divisors (817487505).
1051055055 is an equidigital number, since it uses as much as digits as its factorization.
1051055055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7785607 (or 7785601 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The square root of 1051055055 is about 32419.9792566251. The cubic root of 1051055055 is about 1016.7366727153.
Adding to 1051055055 its reverse (5505501501), we get a palindrome (6556556556).
The spelling of 1051055055 in words is "one billion, fifty-one million, fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •