Base | Representation |
---|---|
bin | 11110010001010011111011… |
… | …111100110010001101010000 |
3 | 122110101012110121121000120210 |
4 | 132101103323330302031100 |
5 | 114422204324012303240 |
6 | 1151051315152204120 |
7 | 40020254053630455 |
oct | 3621237374621520 |
9 | 573335417530523 |
10 | 133131033322320 |
11 | 39468610656420 |
12 | 12b21829839640 |
13 | 5939283093027 |
14 | 24c380d8a382c |
15 | 105d09c715780 |
hex | 7914fbf32350 |
133131033322320 has 80 divisors (see below), whose sum is σ = 450224949062592. Its totient is φ = 32274189895680.
The previous prime is 133131033322319. The next prime is 133131033322367. The reversal of 133131033322320 is 23223330131331.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25214208217 + ... + 25214213496.
Almost surely, 2133131033322320 is an apocalyptic number.
133131033322320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133131033322320 is an abundant number, since it is smaller than the sum of its proper divisors (317093915740272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133131033322320 is a wasteful number, since it uses less digits than its factorization.
133131033322320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50428421740 (or 50428421734 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 30.
Adding to 133131033322320 its reverse (23223330131331), we get a palindrome (156354363453651).
The spelling of 133131033322320 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, thirty-three million, three hundred twenty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •