Base | Representation |
---|---|
bin | 111101000011100010… |
… | …0111000010110100010 |
3 | 110112102122102102012102 |
4 | 1322013010320112202 |
5 | 4122010444104214 |
6 | 140122234130402 |
7 | 12321105000500 |
oct | 1720704702642 |
9 | 415378372172 |
10 | 131115222434 |
11 | 50673141269 |
12 | 214b2280a02 |
13 | c496c55171 |
14 | 64bb64b670 |
15 | 3625c04bde |
hex | 1e871385a2 |
131115222434 has 12 divisors (see below), whose sum is σ = 228782684214. Its totient is φ = 56192238144.
The previous prime is 131115222421. The next prime is 131115222437. The reversal of 131115222434 is 434222511131.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 116905867225 + 14209355209 = 341915^2 + 119203^2 .
It is a junction number, because it is equal to n+sod(n) for n = 131115222397 and 131115222406.
It is not an unprimeable number, because it can be changed into a prime (131115222437) 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, 668955119 + ... + 668955314.
Almost surely, 2131115222434 is an apocalyptic number.
131115222434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
131115222434 is a deficient number, since it is larger than the sum of its proper divisors (97667461780).
131115222434 is a wasteful number, since it uses less digits than its factorization.
131115222434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337910449 (or 1337910442 counting only the distinct ones).
The product of its digits is 5760, while the sum is 29.
Adding to 131115222434 its reverse (434222511131), we get a palindrome (565337733565).
The spelling of 131115222434 in words is "one hundred thirty-one billion, one hundred fifteen million, two hundred twenty-two thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •