Search a number
-
+
103957561152 = 26321729418929
BaseRepresentation
bin110000011010001011…
…0100111111101000000
3100221022222111021112200
41200310112213331000
53200401113424102
6115431335153200
710340110455444
oct1406426477500
9327288437480
10103957561152
11400a73733a5
1218193215800
139a596c24c3
1450628c8824
152a868ca51c
hex18345a7f40

103957561152 has 336 divisors, whose sum is σ = 334380992400. Its totient is φ = 30718033920.

The previous prime is 103957561151. The next prime is 103957561163. The reversal of 103957561152 is 251165759301.

103957561152 is a `hidden beast` number, since 1 + 0 + 3 + 9 + 575 + 61 + 15 + 2 = 666.

It can be written as a sum of positive squares in 8 ways, for example, as 17083535616 + 86874025536 = 130704^2 + 294744^2 .

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

It is a congruent number.

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

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, 11638224 + ... + 11647152.

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

Almost surely, 2103957561152 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 283500, while the sum is 45.

The spelling of 103957561152 in words is "one hundred three billion, nine hundred fifty-seven million, five hundred sixty-one thousand, one hundred fifty-two".