Base | Representation |
---|---|
bin | 111110001110100111… |
… | …1101000000001011010 |
3 | 110202221020010011001001 |
4 | 1330131033220001122 |
5 | 4142140430342110 |
6 | 141220233415214 |
7 | 12440406353404 |
oct | 1743517500132 |
9 | 422836104031 |
10 | 133634621530 |
11 | 51746295083 |
12 | 21a95b6a50a |
13 | c7a8bb7367 |
14 | 667a0abb74 |
15 | 3721eb363a |
hex | 1f1d3e805a |
133634621530 has 64 divisors (see below), whose sum is σ = 261005172480. Its totient is φ = 49077033984.
The previous prime is 133634621521. The next prime is 133634621531. The reversal of 133634621530 is 35126436331.
It is a self number, because there is not a number n which added to its sum of digits gives 133634621530.
It is not an unprimeable number, because it can be changed into a prime (133634621531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1116216 + ... + 1230124.
It is an arithmetic number, because the mean of its divisors is an integer number (4078205820).
Almost surely, 2133634621530 is an apocalyptic number.
133634621530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133634621530 is a deficient number, since it is larger than the sum of its proper divisors (127370550950).
133634621530 is a wasteful number, since it uses less digits than its factorization.
133634621530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114103.
The product of its (nonzero) digits is 116640, while the sum is 37.
The spelling of 133634621530 in words is "one hundred thirty-three billion, six hundred thirty-four million, six hundred twenty-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •