Search a number
-
+
103203010110000 = 2435433247103471
BaseRepresentation
bin10111011101110011010010…
…110000011110001000110000
3111112102010000012220220212210
4113131303102300132020300
5102011334231042010000
61003254450333252120
730511112540644263
oct2735632260361060
9445363005826783
10103203010110000
112a97a17278a269
12b6a9527334040
1345780047a9198
141b6b0a38a4cda
15bde831877350
hex5ddcd2c1e230

103203010110000 has 200 divisors, whose sum is σ = 333166317451264. Its totient is φ = 27519708960000.

The previous prime is 103203010109929. The next prime is 103203010110023. The reversal of 103203010110000 is 11010302301.

103203010110000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (200).

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

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 997358265 + ... + 997461735.

Almost surely, 2103203010110000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 18, while the sum is 12.

Adding to 103203010110000 its reverse (11010302301), we get a palindrome (103214020412301).

The spelling of 103203010110000 in words is "one hundred three trillion, two hundred three billion, ten million, one hundred ten thousand".