Base | Representation |
---|---|
bin | 111111110001111… |
… | …010111100100001 |
3 | 2202120111020011102 |
4 | 333301322330201 |
5 | 4142413113410 |
6 | 254102524145 |
7 | 35342166344 |
oct | 7761727441 |
9 | 2676436142 |
10 | 1070051105 |
11 | 4aa01a262 |
12 | 25a436655 |
13 | 1408c6046 |
14 | a218445b |
15 | 63e1c2a5 |
hex | 3fc7af21 |
1070051105 has 8 divisors (see below), whose sum is σ = 1286252352. Its totient is φ = 854580208.
The previous prime is 1070051093. The next prime is 1070051107. The reversal of 1070051105 is 5011500701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1070051105 - 228 = 801615649 is a prime.
It is a super-2 number, since 2×10700511052 = 2290018734623442050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1070051107) 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 7 ways as a sum of consecutive naturals, for example, 179357 + ... + 185226.
It is an arithmetic number, because the mean of its divisors is an integer number (160781544).
Almost surely, 21070051105 is an apocalyptic number.
It is an amenable number.
1070051105 is a deficient number, since it is larger than the sum of its proper divisors (216201247).
1070051105 is an equidigital number, since it uses as much as digits as its factorization.
1070051105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365175.
The product of its (nonzero) digits is 175, while the sum is 20.
The square root of 1070051105 is about 32711.6356209836. The cubic root of 1070051105 is about 1022.8254052052.
Adding to 1070051105 its reverse (5011500701), we get a palindrome (6081551806).
The spelling of 1070051105 in words is "one billion, seventy million, fifty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •