Search a number
-
+
10705715670 = 23513213715413
BaseRepresentation
bin10011111100001110…
…00100000111010110
31000122002200201000210
421332013010013112
5133411130400140
64530152350250
7526204040016
oct117607040726
930562621023
1010705715670
1145a4108701
1220a93a5386
131017c7b300
14737b87c46
15429d0dd80
hex27e1c41d6

10705715670 has 96 divisors (see below), whose sum is σ = 28027091232. Its totient is φ = 2615847936.

The previous prime is 10705715641. The next prime is 10705715689. The reversal of 10705715670 is 7651750701.

10705715670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×107057156702 (a number of 21 digits) contains 22 as substring.

It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.

It is a Harshad number since it is a multiple of its sum of digits (39).

It is a congruent number.

It is an unprimeable number.

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 47 ways as a sum of consecutive naturals, for example, 686884 + ... + 702296.

It is an arithmetic number, because the mean of its divisors is an integer number (291948867).

Almost surely, 210705715670 is an apocalyptic number.

10705715670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 10705715670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14013545616).

10705715670 is an abundant number, since it is smaller than the sum of its proper divisors (17321375562).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

10705715670 is a wasteful number, since it uses less digits than its factorization.

10705715670 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 15586 (or 15573 counting only the distinct ones).

The product of its (nonzero) digits is 51450, while the sum is 39.

The spelling of 10705715670 in words is "ten billion, seven hundred five million, seven hundred fifteen thousand, six hundred seventy".

Divisors: 1 2 3 5 6 10 13 15 26 30 39 65 78 130 137 169 195 274 338 390 411 507 685 822 845 1014 1370 1690 1781 2055 2535 3562 4110 5070 5343 8905 10686 15413 17810 23153 26715 30826 46239 46306 53430 69459 77065 92478 115765 138918 154130 200369 231195 231530 347295 400738 462390 601107 694590 1001845 1202214 2003690 2111581 2604797 3005535 4223162 5209594 6011070 6334743 7814391 10557905 12669486 13023985 15628782 21115810 26047970 27450553 31673715 39071955 54901106 63347430 78143910 82351659 137252765 164703318 274505530 356857189 411758295 713714378 823516590 1070571567 1784285945 2141143134 3568571890 5352857835 10705715670