Base | Representation |
---|---|
bin | 11101110011110011011111… |
… | …011111100000011000000110 |
3 | 122012012100121120112201021210 |
4 | 131303303133133200120012 |
5 | 114140444110304240400 |
6 | 1142500012225152250 |
7 | 36420621524202243 |
oct | 3563633737403006 |
9 | 565170546481253 |
10 | 131103331321350 |
11 | 38856679746263 |
12 | 1285485448b686 |
13 | 581ccb658b00b |
14 | 2453613c765ca |
15 | 1025472737950 |
hex | 773cdf7e0606 |
131103331321350 has 48 divisors (see below), whose sum is σ = 333066414416400. Its totient is φ = 34108183756800.
The previous prime is 131103331321343. The next prime is 131103331321363. The reversal of 131103331321350 is 53123133301131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10658801275 + ... + 10658813574.
It is an arithmetic number, because the mean of its divisors is an integer number (6938883633675).
Almost surely, 2131103331321350 is an apocalyptic number.
131103331321350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131103331321350 is an abundant number, since it is smaller than the sum of its proper divisors (201963083095050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131103331321350 is a wasteful number, since it uses less digits than its factorization.
131103331321350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21317614905 (or 21317614900 counting only the distinct ones).
The product of its (nonzero) digits is 7290, while the sum is 30.
Adding to 131103331321350 its reverse (53123133301131), we get a palindrome (184226464622481).
The spelling of 131103331321350 in words is "one hundred thirty-one trillion, one hundred three billion, three hundred thirty-one million, three hundred twenty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •