Search a number
BaseRepresentation
bin101110100101111001…
…1101000110110000100
3100120021002011021120201
41131023303220312010
53114403323410102
6113544244540244
710141324416241
oct1351363506604
9316232137521
10100056075652
1139485056615
12174846b1684
1395873143c0
144bb269a5c8
152909114987
hex174bce8d84

100056075652 has 48 divisors (see below), whose sum is σ = 192930232320. Its totient is φ = 45118539648.

The previous prime is 100056075643. The next prime is 100056075673. The reversal of 100056075652 is 256570650001.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 582733 + ... + 734635.

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

Almost surely, 2100056075652 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The spelling of 100056075652 in words is "one hundred billion, fifty-six million, seventy-five thousand, six hundred fifty-two".