Search a number
-
+
1013122110 = 2357112133067
BaseRepresentation
bin111100011000110…
…000010000111110
32121121100221021010
4330120300100332
54033324401420
6244310420050
734051252530
oct7430602076
92547327233
101013122110
1147a976700
12243361626
13131b82b50
14987a5850
155de244e0
hex3c63043e

1013122110 has 192 divisors, whose sum is σ = 3290466816. Its totient is φ = 194261760.

The previous prime is 1013122109. The next prime is 1013122133. The reversal of 1013122110 is 112213101.

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, 328797 + ... + 331863.

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

Almost surely, 21013122110 is an apocalyptic number.

1013122110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 1013122110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1645233408).

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

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

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

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

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

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

The square root of 1013122110 is about 31829.5791678118. The cubic root of 1013122110 is about 1004.3550427363.

Adding to 1013122110 its reverse (112213101), we get a palindrome (1125335211).

Subtracting from 1013122110 its reverse (112213101), we obtain a palindrome (900909009).

The spelling of 1013122110 in words is "one billion, thirteen million, one hundred twenty-two thousand, one hundred ten".