Base | Representation |
---|---|
bin | 11001001111101101000001… |
… | …100110010001001111011110 |
3 | 112120010101121111222210020220 |
4 | 121033231001212101033132 |
5 | 104023110023312320110 |
6 | 1032050340555022210 |
7 | 32246450225164134 |
oct | 3117550146211736 |
9 | 476111544883226 |
10 | 111030300120030 |
11 | 3241775a9557a5 |
12 | 105524baa3a966 |
13 | 49c515cb726b5 |
14 | 1d5bc765d7754 |
15 | cc82460d7370 |
hex | 64fb419913de |
111030300120030 has 64 divisors (see below), whose sum is σ = 266783184645120. Its totient is φ = 29573586520064.
The previous prime is 111030300120029. The next prime is 111030300120073. The reversal of 111030300120030 is 30021003030111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 111030300119991 and 111030300120009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 900873151 + ... + 900996389.
It is an arithmetic number, because the mean of its divisors is an integer number (4168487260080).
Almost surely, 2111030300120030 is an apocalyptic number.
111030300120030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111030300120030 is an abundant number, since it is smaller than the sum of its proper divisors (155752884525090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111030300120030 is a wasteful number, since it uses less digits than its factorization.
111030300120030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157993.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 111030300120030 its reverse (30021003030111), we get a palindrome (141051303150141).
The spelling of 111030300120030 in words is "one hundred eleven trillion, thirty billion, three hundred million, one hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •