Base | Representation |
---|---|
bin | 111101000000011110… |
… | …0111100010010010111 |
3 | 110112011111002110110211 |
4 | 1322000330330102113 |
5 | 4121303143244403 |
6 | 140104124030251 |
7 | 12315416455363 |
oct | 1720074742227 |
9 | 415144073424 |
10 | 131012478103 |
11 | 506201459a1 |
12 | 21483992387 |
13 | c47b8904c0 |
14 | 64abb442a3 |
15 | 361bbac06d |
hex | 1e80f3c497 |
131012478103 has 8 divisors (see below), whose sum is σ = 149389794288. Its totient is φ = 113820795264.
The previous prime is 131012478073. The next prime is 131012478109. The reversal of 131012478103 is 301874210131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131012478103 - 25 = 131012478071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012478109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 296408101 + ... + 296408542.
It is an arithmetic number, because the mean of its divisors is an integer number (18673724286).
Almost surely, 2131012478103 is an apocalyptic number.
131012478103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131012478103 is a deficient number, since it is larger than the sum of its proper divisors (18377316185).
131012478103 is a wasteful number, since it uses less digits than its factorization.
131012478103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592816673.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 131012478103 its reverse (301874210131), we get a palindrome (432886688234).
The spelling of 131012478103 in words is "one hundred thirty-one billion, twelve million, four hundred seventy-eight thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •