Search a number
-
+
106461075200 = 2852232413001
BaseRepresentation
bin110001100100110010…
…0110001011100000000
3101011210110021222012012
41203021210301130000
53221013013401300
6120524010152052
710456130131304
oct1431144613400
9334713258165
10106461075200
1141171557577
1218771722628
13a06828226c
14521d1b1d04
152b8159c435
hex18c9931700

106461075200 has 216 divisors, whose sum is σ = 276197593056. Its totient is φ = 40550400000.

The previous prime is 106461075199. The next prime is 106461075221. The reversal of 106461075200 is 2570164601.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35473700 + ... + 35476700.

Almost surely, 2106461075200 is an apocalyptic number.

106461075200 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 106461075200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138098796528).

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

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

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 32.

The spelling of 106461075200 in words is "one hundred six billion, four hundred sixty-one million, seventy-five thousand, two hundred".