Base | Representation |
---|---|
bin | 1111111000011… |
… | …01010011111001 |
3 | 100021200110112010 |
4 | 13330031103321 |
5 | 233101124143 |
6 | 21115240133 |
7 | 3205245132 |
oct | 774152371 |
9 | 307613463 |
10 | 133223673 |
11 | 69223a10 |
12 | 38749049 |
13 | 217a6b9b |
14 | 1399cc89 |
15 | ba68a33 |
hex | 7f0d4f9 |
133223673 has 16 divisors (see below), whose sum is σ = 194072256. Its totient is φ = 80619840.
The previous prime is 133223669. The next prime is 133223677. The reversal of 133223673 is 376322331.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (133223669) and next prime (133223677).
It is not a de Polignac number, because 133223673 - 22 = 133223669 is a prime.
It is a super-2 number, since 2×1332236732 = 35497094095221858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133223673.
It is not an unprimeable number, because it can be changed into a prime (133223677) 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, 22315 + ... + 27647.
It is an arithmetic number, because the mean of its divisors is an integer number (12129516).
Almost surely, 2133223673 is an apocalyptic number.
It is an amenable number.
133223673 is a deficient number, since it is larger than the sum of its proper divisors (60848583).
133223673 is a wasteful number, since it uses less digits than its factorization.
133223673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6104.
The product of its digits is 13608, while the sum is 30.
The square root of 133223673 is about 11542.2559753282. The cubic root of 133223673 is about 510.7328602686.
The spelling of 133223673 in words is "one hundred thirty-three million, two hundred twenty-three thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •