Base | Representation |
---|---|
bin | 1111111011010… |
… | …01010011010110 |
3 | 100022101121101120 |
4 | 13331221103112 |
5 | 233200203340 |
6 | 21131304410 |
7 | 3211404513 |
oct | 775512326 |
9 | 308347346 |
10 | 133600470 |
11 | 69461013 |
12 | 388ab106 |
13 | 218a9543 |
14 | 13a5a30a |
15 | bae04d0 |
hex | 7f694d6 |
133600470 has 16 divisors (see below), whose sum is σ = 320641200. Its totient is φ = 35626784.
The previous prime is 133600469. The next prime is 133600471. The reversal of 133600470 is 74006331.
It is an interprime number because it is at equal distance from previous prime (133600469) and next prime (133600471).
It is a self number, because there is not a number n which added to its sum of digits gives 133600470.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133600471) 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 7 ways as a sum of consecutive naturals, for example, 2226645 + ... + 2226704.
It is an arithmetic number, because the mean of its divisors is an integer number (20040075).
Almost surely, 2133600470 is an apocalyptic number.
133600470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133600470 is an abundant number, since it is smaller than the sum of its proper divisors (187040730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133600470 is a wasteful number, since it uses less digits than its factorization.
133600470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4453359.
The product of its (nonzero) digits is 1512, while the sum is 24.
The square root of 133600470 is about 11558.5669526979. The cubic root of 133600470 is about 511.2139095723.
The spelling of 133600470 in words is "one hundred thirty-three million, six hundred thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •