Base | Representation |
---|---|
bin | 1101011100111010110… |
… | …1100111101000101101 |
3 | 211002111211221001101002 |
4 | 3113032231213220231 |
5 | 12241243420111023 |
6 | 254055543330045 |
7 | 22460622624236 |
oct | 3271655475055 |
9 | 732454831332 |
10 | 231101332013 |
11 | 8a01174a282 |
12 | 38957450925 |
13 | 18a3c910306 |
14 | b2848d408d |
15 | 6028ae8b28 |
hex | 35ceb67a2d |
231101332013 has 2 divisors, whose sum is σ = 231101332014. Its totient is φ = 231101332012.
The previous prime is 231101332009. The next prime is 231101332037. The reversal of 231101332013 is 310233101132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208865452324 + 22235879689 = 457018^2 + 149117^2 .
It is a cyclic number.
It is not a de Polignac number, because 231101332013 - 22 = 231101332009 is a prime.
It is a super-3 number, since 3×2311013320133 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231101332613) 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, 115550666006 + 115550666007.
It is an arithmetic number, because the mean of its divisors is an integer number (115550666007).
Almost surely, 2231101332013 is an apocalyptic number.
It is an amenable number.
231101332013 is a deficient number, since it is larger than the sum of its proper divisors (1).
231101332013 is an equidigital number, since it uses as much as digits as its factorization.
231101332013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 231101332013 its reverse (310233101132), we get a palindrome (541334433145).
The spelling of 231101332013 in words is "two hundred thirty-one billion, one hundred one million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •