Base | Representation |
---|---|
bin | 1111101011011… |
… | …10001010010111 |
3 | 100011111001221111 |
4 | 13311232022113 |
5 | 232132220343 |
6 | 21014555451 |
7 | 3154633426 |
oct | 765561227 |
9 | 304431844 |
10 | 131523223 |
11 | 68272387 |
12 | 38068b87 |
13 | 2132cbc0 |
14 | 136792bd |
15 | b82ec9d |
hex | 7d6e297 |
131523223 has 16 divisors (see below), whose sum is σ = 149216256. Its totient is φ = 115014240.
The previous prime is 131523193. The next prime is 131523251. The reversal of 131523223 is 322325131.
It is a cyclic number.
It is not a de Polignac number, because 131523223 - 213 = 131515031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131523194 and 131523203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131523523) 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, 29938 + ... + 34048.
It is an arithmetic number, because the mean of its divisors is an integer number (9326016).
Almost surely, 2131523223 is an apocalyptic number.
131523223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131523223 is a deficient number, since it is larger than the sum of its proper divisors (17693033).
131523223 is a wasteful number, since it uses less digits than its factorization.
131523223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4254.
The product of its digits is 1080, while the sum is 22.
The square root of 131523223 is about 11468.3574673970. The cubic root of 131523223 is about 508.5505725489.
Adding to 131523223 its reverse (322325131), we get a palindrome (453848354).
The spelling of 131523223 in words is "one hundred thirty-one million, five hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •