Base | Representation |
---|---|
bin | 111101111110101100… |
… | …1011011010111100111 |
3 | 110201112222201211110001 |
4 | 1323331121123113213 |
5 | 4140042140221411 |
6 | 141051225442131 |
7 | 12421231024564 |
oct | 1737531332747 |
9 | 421488654401 |
10 | 133100320231 |
11 | 514a172a65a |
12 | 21967040347 |
13 | c7222b2548 |
14 | 662914786b |
15 | 36e0121dc1 |
hex | 1efd65b5e7 |
133100320231 has 4 divisors (see below), whose sum is σ = 133109297464. Its totient is φ = 133091343000.
The previous prime is 133100320219. The next prime is 133100320259. The reversal of 133100320231 is 132023001331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133100320231 - 221 = 133098223079 is a prime.
It is a super-2 number, since 2×1331003202312 (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 = 133100320199 and 133100320208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133100320291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4466340 + ... + 4496041.
It is an arithmetic number, because the mean of its divisors is an integer number (33277324366).
Almost surely, 2133100320231 is an apocalyptic number.
133100320231 is a deficient number, since it is larger than the sum of its proper divisors (8977233).
133100320231 is an equidigital number, since it uses as much as digits as its factorization.
133100320231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8977232.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 133100320231 its reverse (132023001331), we get a palindrome (265123321562).
The spelling of 133100320231 in words is "one hundred thirty-three billion, one hundred million, three hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •