Search a number
-
+
105675900000 = 2535511311033
BaseRepresentation
bin110001001101011000…
…1100100010001100000
3101002202201211221022020
41202122301210101200
53212411012300000
6120314041141440
710430514220626
oct1423261442140
9332681757266
10105675900000
11408a9321850
121859278a880
139c716c0058
145186bc5516
152b376a2ba0
hex189ac64460

105675900000 has 576 divisors, whose sum is σ = 390826985472. Its totient is φ = 24768000000.

The previous prime is 105675899963. The next prime is 105675900017. The reversal of 105675900000 is 9576501.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 102299484 + ... + 102300516.

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

Almost surely, 2105675900000 is an apocalyptic number.

105675900000 is a gapful number since it is divisible by the number (10) 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 105675900000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195413492736).

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

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

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 33.

The spelling of 105675900000 in words is "one hundred five billion, six hundred seventy-five million, nine hundred thousand".