Base | Representation |
---|---|
bin | 1101011100100101110… |
… | …1111010110011010101 |
3 | 211002021201100002111012 |
4 | 3113021131322303111 |
5 | 12241103403031013 |
6 | 254043121222005 |
7 | 22455503623055 |
oct | 3271135726325 |
9 | 732251302435 |
10 | 231013330133 |
11 | 89a77003153 |
12 | 38931a91905 |
13 | 18a2760a9b1 |
14 | b276d47565 |
15 | 60210141a8 |
hex | 35c977acd5 |
231013330133 has 2 divisors, whose sum is σ = 231013330134. Its totient is φ = 231013330132.
The previous prime is 231013330127. The next prime is 231013330189. The reversal of 231013330133 is 331033310132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216357080164 + 14656249969 = 465142^2 + 121063^2 .
It is a cyclic number.
It is not a de Polignac number, because 231013330133 - 210 = 231013329109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231013330099 and 231013330108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231013330193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115506665066 + 115506665067.
It is an arithmetic number, because the mean of its divisors is an integer number (115506665067).
Almost surely, 2231013330133 is an apocalyptic number.
It is an amenable number.
231013330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
231013330133 is an equidigital number, since it uses as much as digits as its factorization.
231013330133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 231013330133 its reverse (331033310132), we get a palindrome (562046640265).
The spelling of 231013330133 in words is "two hundred thirty-one billion, thirteen million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •