Base | Representation |
---|---|
bin | 111101000011000101… |
… | …1101100111001110011 |
3 | 110112101121012220000110 |
4 | 1322012023230321303 |
5 | 4121443124431311 |
6 | 140120540552403 |
7 | 12320533411464 |
oct | 1720613547163 |
9 | 415347186013 |
10 | 131100233331 |
11 | 50665733781 |
12 | 214a9252703 |
13 | c493b07782 |
14 | 64b9668d6b |
15 | 36247438a6 |
hex | 1e862ece73 |
131100233331 has 4 divisors (see below), whose sum is σ = 174800311112. Its totient is φ = 87400155552.
The previous prime is 131100233323. The next prime is 131100233353. The reversal of 131100233331 is 133332001131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 131100233331 - 23 = 131100233323 is a prime.
It is a super-3 number, since 3×1311002333313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131100233298 and 131100233307.
It is not an unprimeable number, because it can be changed into a prime (131100233321) 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, 21850038886 + ... + 21850038891.
It is an arithmetic number, because the mean of its divisors is an integer number (43700077778).
Almost surely, 2131100233331 is an apocalyptic number.
131100233331 is a deficient number, since it is larger than the sum of its proper divisors (43700077781).
131100233331 is an equidigital number, since it uses as much as digits as its factorization.
131100233331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43700077780.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 131100233331 its reverse (133332001131), we get a palindrome (264432234462).
The spelling of 131100233331 in words is "one hundred thirty-one billion, one hundred million, two hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •