Base | Representation |
---|---|
bin | 11011010011110101001001… |
… | …111001000000000111100110 |
3 | 120202021101220102101201002110 |
4 | 123103311021321000013212 |
5 | 111220340240012041402 |
6 | 1103241434453021450 |
7 | 34204442525542350 |
oct | 3323651171000746 |
9 | 522241812351073 |
10 | 120110000112102 |
11 | 352a8401890570 |
12 | 1157a158024886 |
13 | 520342a9658c0 |
14 | 21934d82820d0 |
15 | dd450b77156c |
hex | 6d3d49e401e6 |
120110000112102 has 256 divisors, whose sum is σ = 334530027288576. Its totient is φ = 27741864960000.
The previous prime is 120110000112071. The next prime is 120110000112127. The reversal of 120110000112102 is 201211000011021.
It is a congruent number.
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 127 ways as a sum of consecutive naturals, for example, 19768702 + ... + 25120142.
It is an arithmetic number, because the mean of its divisors is an integer number (1306757919096).
Almost surely, 2120110000112102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120110000112102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167265013644288).
120110000112102 is an abundant number, since it is smaller than the sum of its proper divisors (214420027176474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120110000112102 is a wasteful number, since it uses less digits than its factorization.
120110000112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5351615.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120110000112102 its reverse (201211000011021), we get a palindrome (321321000123123).
The spelling of 120110000112102 in words is "one hundred twenty trillion, one hundred ten billion, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •