Search a number
-
+
10172161100656 = 24635760068791
BaseRepresentation
bin1001010000000110010000…
…0011001000101101110000
31100000110010101201022201201
42110001210003020231300
52313130041220210111
633345005402540544
72066625430506412
oct224014403105560
940013111638651
1010172161100656
113271a97832095
121183524207754
1358a2cca44399
14272499bd89b2
151299043746c1
hex940640c8b70

10172161100656 has 10 divisors (see below), whose sum is σ = 19708562132552. Its totient is φ = 5086080550320.

The previous prime is 10172161100609. The next prime is 10172161100657. The reversal of 10172161100656 is 65600116127101.

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

It is a congruent number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 317880034380 + ... + 317880034411.

Almost surely, 210172161100656 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 37.

Adding to 10172161100656 its reverse (65600116127101), we get a palindrome (75772277227757).

The spelling of 10172161100656 in words is "ten trillion, one hundred seventy-two billion, one hundred sixty-one million, one hundred thousand, six hundred fifty-six".

Divisors: 1 2 4 8 16 635760068791 1271520137582 2543040275164 5086080550328 10172161100656