Base | Representation |
---|---|
bin | 111101111111100111… |
… | …0110110011101001111 |
3 | 110201122010122201010201 |
4 | 1323333032312131033 |
5 | 4140123030231111 |
6 | 141054245314331 |
7 | 12422053460464 |
oct | 1737716663517 |
9 | 421563581121 |
10 | 133131102031 |
11 | 51508044464 |
12 | 219754059a7 |
13 | c72879c325 |
14 | 662d27b66b |
15 | 36e2ba26c1 |
hex | 1eff3b674f |
133131102031 has 4 divisors (see below), whose sum is σ = 134626957200. Its totient is φ = 131635246864.
The previous prime is 133131102011. The next prime is 133131102079. The reversal of 133131102031 is 130201131331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130201131331 = 167 ⋅779647493.
It is a cyclic number.
It is not a de Polignac number, because 133131102031 - 213 = 133131093839 is a prime.
It is a super-2 number, since 2×1331311020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133131102011) 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, 747927451 + ... + 747927628.
It is an arithmetic number, because the mean of its divisors is an integer number (33656739300).
Almost surely, 2133131102031 is an apocalyptic number.
133131102031 is a deficient number, since it is larger than the sum of its proper divisors (1495855169).
133131102031 is an equidigital number, since it uses as much as digits as its factorization.
133131102031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495855168.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 133131102031 its reverse (130201131331), we get a palindrome (263332233362).
The spelling of 133131102031 in words is "one hundred thirty-three billion, one hundred thirty-one million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •