Base | Representation |
---|---|
bin | 1111101011101… |
… | …11011100000011 |
3 | 100011120000001202 |
4 | 13311313130003 |
5 | 232134424334 |
6 | 21015451415 |
7 | 3155152256 |
oct | 765673403 |
9 | 304500052 |
10 | 131561219 |
11 | 68298989 |
12 | 38086b6b |
13 | 2134429a |
14 | 1368909d |
15 | b83b17e |
hex | 7d77703 |
131561219 has 4 divisors (see below), whose sum is σ = 137281296. Its totient is φ = 125841144.
The previous prime is 131561207. The next prime is 131561273. The reversal of 131561219 is 912165131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 912165131 = 20117 ⋅45343.
It is a cyclic number.
It is not a de Polignac number, because 131561219 - 220 = 130512643 is a prime.
It is a super-2 number, since 2×1315612192 = 34616708689531922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131561191 and 131561200.
It is not an unprimeable number, because it can be changed into a prime (131561519) 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 3 ways as a sum of consecutive naturals, for example, 2860004 + ... + 2860049.
It is an arithmetic number, because the mean of its divisors is an integer number (34320324).
Almost surely, 2131561219 is an apocalyptic number.
131561219 is a deficient number, since it is larger than the sum of its proper divisors (5720077).
131561219 is an equidigital number, since it uses as much as digits as its factorization.
131561219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5720076.
The product of its digits is 1620, while the sum is 29.
The square root of 131561219 is about 11470.0139058329. The cubic root of 131561219 is about 508.5995398888.
The spelling of 131561219 in words is "one hundred thirty-one million, five hundred sixty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •