Search a number
-
+
12101102010 = 23251723367937
BaseRepresentation
bin10110100010100100…
…00010100110111010
31011020100100200020100
423101102002212322
5144240340231020
65320440340230
7605606445534
oct132122024672
934210320210
1012101102010
11514a836058
122418774676
1311ab0a2aba
1482b218854
154ac591a90
hex2d14829ba

12101102010 has 192 divisors, whose sum is σ = 34893960192. Its totient is φ = 2894082048.

The previous prime is 12101102009. The next prime is 12101102089. The reversal of 12101102010 is 1020110121.

It is a happy number.

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

It is a junction number, because it is equal to n+sod(n) for n = 12101101983 and 12101102001.

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, 12914262 + ... + 12915198.

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

Almost surely, 212101102010 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 12101102010 its reverse (1020110121), we get a palindrome (13121212131).

The spelling of 12101102010 in words is "twelve billion, one hundred one million, one hundred two thousand, ten".