Base | Representation |
---|---|
bin | 1111110110111… |
… | …00110010011010 |
3 | 100021022100212222 |
4 | 13323130302122 |
5 | 233023244142 |
6 | 21111104042 |
7 | 3203456522 |
oct | 773346232 |
9 | 307270788 |
10 | 133024922 |
11 | 690a8658 |
12 | 38672022 |
13 | 21737594 |
14 | 1394a682 |
15 | ba29bd2 |
hex | 7edcc9a |
133024922 has 8 divisors (see below), whose sum is σ = 199593396. Its totient is φ = 66493792.
The previous prime is 133024897. The next prime is 133024967. The reversal of 133024922 is 229420331.
It can be written as a sum of positive squares in 2 ways, for example, as 132687361 + 337561 = 11519^2 + 581^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 133024891 and 133024900.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2648 + ... + 16524.
Almost surely, 2133024922 is an apocalyptic number.
133024922 is a deficient number, since it is larger than the sum of its proper divisors (66568474).
133024922 is a wasteful number, since it uses less digits than its factorization.
133024922 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18672.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 133024922 is about 11533.6430497913. The cubic root of 133024922 is about 510.4787533090.
The spelling of 133024922 in words is "one hundred thirty-three million, twenty-four thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •