Base | Representation |
---|---|
bin | 1111111001001… |
… | …01010100100110 |
3 | 100021212110102200 |
4 | 13330211110212 |
5 | 233112301042 |
6 | 21121315330 |
7 | 3206134641 |
oct | 774452446 |
9 | 307773380 |
10 | 133322022 |
11 | 69290899 |
12 | 38795b46 |
13 | 2180c892 |
14 | 139c6a58 |
15 | ba87c4c |
hex | 7f25526 |
133322022 has 12 divisors (see below), whose sum is σ = 288864420. Its totient is φ = 44440668.
The previous prime is 133322009. The next prime is 133322023. The reversal of 133322022 is 220223331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 7406779 = 133322022 / (1 + 3 + 3 + 3 + 2 + 2 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 133321986 and 133322004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133322023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3703372 + ... + 3703407.
It is an arithmetic number, because the mean of its divisors is an integer number (24072035).
Almost surely, 2133322022 is an apocalyptic number.
133322022 is an abundant number, since it is smaller than the sum of its proper divisors (155542398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133322022 is a wasteful number, since it uses less digits than its factorization.
133322022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7406787 (or 7406784 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
The square root of 133322022 is about 11546.5155783033. The cubic root of 133322022 is about 510.8585078848.
Adding to 133322022 its reverse (220223331), we get a palindrome (353545353).
The spelling of 133322022 in words is "one hundred thirty-three million, three hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •