Search a number
-
+
101656630739 = 476883314239
BaseRepresentation
bin101111010101100110…
…1010001010111010011
3100201101121212220101202
41132223031101113103
53131143044140424
6114411142221415
710226101050506
oct1365315212723
9321347786352
10101656630739
113a126577314
121785072486b
139780ab2a11
144cc509713d
15299e8c32ae
hex17ab3515d3

101656630739 has 8 divisors (see below), whose sum is σ = 103834951680. Its totient is φ = 99478952136.

The previous prime is 101656630727. The next prime is 101656630741. The reversal of 101656630739 is 937036656101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101656630739 is a prime.

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

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 101656630693 and 101656630702.

It is not an unprimeable number, because it can be changed into a prime (101656630139) by changing a digit.

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

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

Almost surely, 2101656630739 is an apocalyptic number.

101656630739 is a deficient number, since it is larger than the sum of its proper divisors (2178320941).

101656630739 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 321169.

The product of its (nonzero) digits is 612360, while the sum is 47.

The spelling of 101656630739 in words is "one hundred one billion, six hundred fifty-six million, six hundred thirty thousand, seven hundred thirty-nine".

Divisors: 1 47 6883 314239 323501 14769233 2162907037 101656630739