Base | Representation |
---|---|
bin | 111101000011011100… |
… | …0101000000101110100 |
3 | 110112102102101012201002 |
4 | 1322012320220011310 |
5 | 4122004133310400 |
6 | 140122041222432 |
7 | 12321035461211 |
oct | 1720670500564 |
9 | 415372335632 |
10 | 131112010100 |
11 | 50671347845 |
12 | 214b1191a18 |
13 | c49639bc86 |
14 | 64bb052b08 |
15 | 36257bced5 |
hex | 1e86e28174 |
131112010100 has 18 divisors (see below), whose sum is σ = 284513062134. Its totient is φ = 52444804000.
The previous prime is 131112010087. The next prime is 131112010103. The reversal of 131112010100 is 1010211131.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 10268174224 + 120843835876 = 101332^2 + 347626^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131112010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 655559951 + ... + 655560150.
Almost surely, 2131112010100 is an apocalyptic number.
131112010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131112010100 is an abundant number, since it is smaller than the sum of its proper divisors (153401052034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131112010100 is a wasteful number, since it uses less digits than its factorization.
131112010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311120115 (or 1311120108 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 131112010100 its reverse (1010211131), we get a palindrome (132122221231).
The spelling of 131112010100 in words is "one hundred thirty-one billion, one hundred twelve million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •