Base | Representation |
---|---|
bin | 1111111000011… |
… | …01011100100111 |
3 | 100021200111021210 |
4 | 13330031130213 |
5 | 233101133411 |
6 | 21115242503 |
7 | 3205246560 |
oct | 774153447 |
9 | 307614253 |
10 | 133224231 |
11 | 69224378 |
12 | 38749433 |
13 | 217a720a |
14 | 1399d167 |
15 | ba68ca6 |
hex | 7f0d727 |
133224231 has 32 divisors (see below), whose sum is σ = 211023360. Its totient is φ = 73148544.
The previous prime is 133224227. The next prime is 133224239. The reversal of 133224231 is 132422331.
It is not a de Polignac number, because 133224231 - 22 = 133224227 is a prime.
It is a super-2 number, since 2×1332242312 = 35497391451082722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 133224198 and 133224207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133224239) 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 31 ways as a sum of consecutive naturals, for example, 171961 + ... + 172733.
It is an arithmetic number, because the mean of its divisors is an integer number (6594480).
Almost surely, 2133224231 is an apocalyptic number.
133224231 is a deficient number, since it is larger than the sum of its proper divisors (77799129).
133224231 is a wasteful number, since it uses less digits than its factorization.
133224231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095.
The product of its digits is 864, while the sum is 21.
The square root of 133224231 is about 11542.2801473539. The cubic root of 133224231 is about 510.7335733264.
Adding to 133224231 its reverse (132422331), we get a palindrome (265646562).
The spelling of 133224231 in words is "one hundred thirty-three million, two hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •