Search a number
-
+
10123106941200 = 243521123111729851
BaseRepresentation
bin1001001101001111100000…
…1100010111100100010000
31022211202111201122211102010
42103103320030113210100
52311324110334104300
633310254030022520
72063241012154311
oct223237014274420
938752451584363
1010123106941200
113253204a61040
121175b14047a40
135857b2c2b126
1426dd64d58608
151284d2a63a50
hex934f8317910

10123106941200 has 480 divisors, whose sum is σ = 36948014318592. Its totient is φ = 2345207040000.

The previous prime is 10123106941187. The next prime is 10123106941237. The reversal of 10123106941200 is 214960132101.

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

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 95 ways as a sum of consecutive naturals, for example, 339106275 + ... + 339136125.

Almost surely, 210123106941200 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10123106941200 in words is "ten trillion, one hundred twenty-three billion, one hundred six million, nine hundred forty-one thousand, two hundred".