Base | Representation |
---|---|
bin | 111110000100111101… |
… | …0001011011000111000 |
3 | 110202002121201110102110 |
4 | 1330021322023120320 |
5 | 4141004404411440 |
6 | 141124124532320 |
7 | 12426360163602 |
oct | 1741172133070 |
9 | 422077643373 |
10 | 133310232120 |
11 | 5159a17255a |
12 | 21a053b10a0 |
13 | c75692a270 |
14 | 6648d8a172 |
15 | 3703788080 |
hex | 1f09e8b638 |
133310232120 has 192 divisors, whose sum is σ = 457521412320. Its totient is φ = 30884438016.
The previous prime is 133310232089. The next prime is 133310232169. The reversal of 133310232120 is 21232013331.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 302994 + ... + 598686.
Almost surely, 2133310232120 is an apocalyptic number.
133310232120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133310232120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228760706160).
133310232120 is an abundant number, since it is smaller than the sum of its proper divisors (324211180200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133310232120 is a wasteful number, since it uses less digits than its factorization.
133310232120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295754 (or 295733 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 133310232120 its reverse (21232013331), we get a palindrome (154542245451).
The spelling of 133310232120 in words is "one hundred thirty-three billion, three hundred ten million, two hundred thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •