Base | Representation |
---|---|
bin | 1111101011010… |
… | …01110000111101 |
3 | 100011110011020110 |
4 | 13311221300331 |
5 | 232131131323 |
6 | 21014340233 |
7 | 3154530060 |
oct | 765516075 |
9 | 304404213 |
10 | 131505213 |
11 | 6825a8a4 |
12 | 3805a679 |
13 | 21324948 |
14 | 136728d7 |
15 | b829793 |
hex | 7d69c3d |
131505213 has 16 divisors (see below), whose sum is σ = 210936320. Its totient is φ = 71190576.
The previous prime is 131505211. The next prime is 131505229. The reversal of 131505213 is 312505131.
It is not a de Polignac number, because 131505213 - 21 = 131505211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 131505213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131505211) 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 15 ways as a sum of consecutive naturals, for example, 164395 + ... + 165192.
It is an arithmetic number, because the mean of its divisors is an integer number (13183520).
Almost surely, 2131505213 is an apocalyptic number.
It is an amenable number.
131505213 is a deficient number, since it is larger than the sum of its proper divisors (79431107).
131505213 is a wasteful number, since it uses less digits than its factorization.
131505213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329616.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 131505213 is about 11467.5722365285. The cubic root of 131505213 is about 508.5273588692.
The spelling of 131505213 in words is "one hundred thirty-one million, five hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •