Base | Representation |
---|---|
bin | 101000110101… |
… | …100010101001 |
3 | 202010212120220 |
4 | 220311202221 |
5 | 10220030230 |
6 | 1021240253 |
7 | 156664050 |
oct | 50654251 |
9 | 22125526 |
10 | 10705065 |
11 | 6051968 |
12 | 3703089 |
13 | 22aa777 |
14 | 15c9397 |
15 | e16d10 |
hex | a358a9 |
10705065 has 32 divisors (see below), whose sum is σ = 20038656. Its totient is φ = 4777920.
The previous prime is 10705061. The next prime is 10705069. The reversal of 10705065 is 56050701.
It is an interprime number because it is at equal distance from previous prime (10705061) and next prime (10705069).
It is not a de Polignac number, because 10705065 - 22 = 10705061 is a prime.
It is a super-2 number, since 2×107050652 = 229196833308450, which contains 22 as substring.
It is a zygodrome in base 13.
It is not an unprimeable number, because it can be changed into a prime (10705061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3330 + ... + 5700.
It is an arithmetic number, because the mean of its divisors is an integer number (626208).
Almost surely, 210705065 is an apocalyptic number.
10705065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10705065 is a deficient number, since it is larger than the sum of its proper divisors (9333591).
10705065 is a wasteful number, since it uses less digits than its factorization.
10705065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2429.
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 10705065 is about 3271.8595630008. The cubic root of 10705065 is about 220.3923096494.
Adding to 10705065 its reverse (56050701), we get a palindrome (66755766).
The spelling of 10705065 in words is "ten million, seven hundred five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •