Base | Representation |
---|---|
bin | 111110001100001010… |
… | …1011011011010000000 |
3 | 110202201111010120122120 |
4 | 1330120111123122000 |
5 | 4142003334203030 |
6 | 141204132204240 |
7 | 12435356310465 |
oct | 1743025333200 |
9 | 422644116576 |
10 | 133552256640 |
11 | 51703849120 |
12 | 21a72469680 |
13 | c794b0973a |
14 | 666d18b66c |
15 | 3719b44010 |
hex | 1f1855b680 |
133552256640 has 128 divisors (see below), whose sum is σ = 464397693120. Its totient is φ = 32376299520.
The previous prime is 133552256611. The next prime is 133552256657. The reversal of 133552256640 is 46652255331.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 133552256592 and 133552256601.
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 15 ways as a sum of consecutive naturals, for example, 3140629 + ... + 3182868.
Almost surely, 2133552256640 is an apocalyptic number.
133552256640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133552256640 is an abundant number, since it is smaller than the sum of its proper divisors (330845436480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133552256640 is a wasteful number, since it uses less digits than its factorization.
133552256640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6323530 (or 6323518 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 42.
It can be divided in two parts, 13355225 and 6640, that added together give a triangular number (13361865 = T5169).
The spelling of 133552256640 in words is "one hundred thirty-three billion, five hundred fifty-two million, two hundred fifty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •