Base | Representation |
---|---|
bin | 111101111110101100… |
… | …0101000010111011001 |
3 | 110201112222100012212122 |
4 | 1323331120220113121 |
5 | 4140042112030241 |
6 | 141051221151025 |
7 | 12421226164532 |
oct | 1737530502731 |
9 | 421488305778 |
10 | 133100111321 |
11 | 514a15a7701 |
12 | 21966b5b475 |
13 | c72223b428 |
14 | 66290d1689 |
15 | 36e00d004b |
hex | 1efd6285d9 |
133100111321 has 8 divisors (see below), whose sum is σ = 141187180320. Its totient is φ = 125041670208.
The previous prime is 133100111299. The next prime is 133100111393. The reversal of 133100111321 is 123111001331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133100111321 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133100111321.
It is not an unprimeable number, because it can be changed into a prime (133100111621) 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, 7147391 + ... + 7165988.
It is an arithmetic number, because the mean of its divisors is an integer number (17648397540).
Almost surely, 2133100111321 is an apocalyptic number.
It is an amenable number.
133100111321 is a deficient number, since it is larger than the sum of its proper divisors (8087068999).
133100111321 is a wasteful number, since it uses less digits than its factorization.
133100111321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14313943.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133100111321 its reverse (123111001331), we get a palindrome (256211112652).
The spelling of 133100111321 in words is "one hundred thirty-three billion, one hundred million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •