Base | Representation |
---|---|
bin | 111101111111010010… |
… | …0111000111101010111 |
3 | 110201121100221212020201 |
4 | 1323332210320331113 |
5 | 4140112221232411 |
6 | 141053213441331 |
7 | 12421561125214 |
oct | 1737644707527 |
9 | 421540855221 |
10 | 133120102231 |
11 | 51501911116 |
12 | 219717a0247 |
13 | c72641a67c |
14 | 662ba16b0b |
15 | 36e1c2d3c1 |
hex | 1efe938f57 |
133120102231 has 8 divisors (see below), whose sum is σ = 135302695424. Its totient is φ = 130954627800.
The previous prime is 133120102189. The next prime is 133120102289. The reversal of 133120102231 is 132201021331.
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 133120102231 - 233 = 124530167639 is a prime.
It is a super-2 number, since 2×1331201022312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133120102199 and 133120102208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133120102931) 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, 4264011 + ... + 4295116.
It is an arithmetic number, because the mean of its divisors is an integer number (16912836928).
Almost surely, 2133120102231 is an apocalyptic number.
133120102231 is a deficient number, since it is larger than the sum of its proper divisors (2182593193).
133120102231 is a wasteful number, since it uses less digits than its factorization.
133120102231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8559381.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133120102231 its reverse (132201021331), we get a palindrome (265321123562).
The spelling of 133120102231 in words is "one hundred thirty-three billion, one hundred twenty million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •