Base | Representation |
---|---|
bin | 11110010010010100011101… |
… | …110101111001101101001101 |
3 | 122110121211022102101002012211 |
4 | 132102110131311321231031 |
5 | 114424323224240420414 |
6 | 1151143214412430421 |
7 | 40025256065014456 |
oct | 3622243565715515 |
9 | 573554272332184 |
10 | 133200321420109 |
11 | 39494a36a09859 |
12 | 12b33146178411 |
13 | 5942975b91968 |
14 | 24c6d03b2412d |
15 | 105eca55a23c4 |
hex | 79251dd79b4d |
133200321420109 has 8 divisors (see below), whose sum is σ = 137761015991040. Its totient is φ = 128656121224800.
The previous prime is 133200321420097. The next prime is 133200321420157. The reversal of 133200321420109 is 901024123002331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133200321420109 - 241 = 131001298164557 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133200321420169) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4123577479 + ... + 4123609780.
It is an arithmetic number, because the mean of its divisors is an integer number (17220126998880).
Almost surely, 2133200321420109 is an apocalyptic number.
It is an amenable number.
133200321420109 is a deficient number, since it is larger than the sum of its proper divisors (4560694570931).
133200321420109 is an equidigital number, since it uses as much as digits as its factorization.
133200321420109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8247187811.
The product of its (nonzero) digits is 7776, while the sum is 31.
The spelling of 133200321420109 in words is "one hundred thirty-three trillion, two hundred billion, three hundred twenty-one million, four hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •