Search a number
-
+
10492107401100 = 223521317237435851
BaseRepresentation
bin1001100010101110001001…
…0101011010011110001100
31101011000222000010101210010
42120223202111122132030
52333400313443313400
634152001350313220
72132013126262353
oct230534225323614
941130860111703
1010492107401100
113385750110106
121215535658810
135b152b098620
14283b6c04499a
15132dccbe3450
hex98ae255a78c

10492107401100 has 864 divisors, whose sum is σ = 36502846057216. Its totient is φ = 2309658624000.

The previous prime is 10492107401093. The next prime is 10492107401129. The reversal of 10492107401100 is 110470129401.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 1793213175 + ... + 1793219025.

Almost surely, 210492107401100 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2016, while the sum is 30.

The spelling of 10492107401100 in words is "ten trillion, four hundred ninety-two billion, one hundred seven million, four hundred one thousand, one hundred".