Search a number
-
+
10195670670 = 235339855689
BaseRepresentation
bin10010111111011010…
…11001011010001110
3222022112221201211020
421133231121122032
5131340042430140
64403412335010
7510441525243
oct113755313216
928275851736
1010195670670
114362210309
121b86614466
13c663ba033
146ca1395ca
153ea15e6d0
hex25fb5968e

10195670670 has 16 divisors (see below), whose sum is σ = 24469609680. Its totient is φ = 2718845504.

The previous prime is 10195670651. The next prime is 10195670699. The reversal of 10195670670 is 7607659101.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169927815 + ... + 169927874.

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

Almost surely, 210195670670 is an apocalyptic number.

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

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

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

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

10195670670 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 339855699.

The product of its (nonzero) digits is 79380, while the sum is 42.

The spelling of 10195670670 in words is "ten billion, one hundred ninety-five million, six hundred seventy thousand, six hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 339855689 679711378 1019567067 1699278445 2039134134 3398556890 5097835335 10195670670