Base | Representation |
---|---|
bin | 10111011010111111110000… |
… | …010010110000111110011001 |
3 | 111111201200102012002220021221 |
4 | 113122333300102300332121 |
5 | 102000204423410023001 |
6 | 1003030125231532041 |
7 | 30461146402665625 |
oct | 2732776022607631 |
9 | 444650365086257 |
10 | 103010232111001 |
11 | 2a905437612336 |
12 | b6780a638a021 |
13 | 4562a917813a7 |
14 | 1b61a16a0c185 |
15 | bd97ec4701a1 |
hex | 5daff04b0f99 |
103010232111001 has 2 divisors, whose sum is σ = 103010232111002. Its totient is φ = 103010232111000.
The previous prime is 103010232110909. The next prime is 103010232111023. The reversal of 103010232111001 is 100111232010301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102822114735376 + 188117375625 = 10140124^2 + 433725^2 .
It is a cyclic number.
It is not a de Polignac number, because 103010232111001 - 215 = 103010232078233 is a prime.
It is a super-2 number, since 2×1030102321110012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103010232111301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505116055500 + 51505116055501.
It is an arithmetic number, because the mean of its divisors is an integer number (51505116055501).
Almost surely, 2103010232111001 is an apocalyptic number.
It is an amenable number.
103010232111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
103010232111001 is an equidigital number, since it uses as much as digits as its factorization.
103010232111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 103010232111001 its reverse (100111232010301), we get a palindrome (203121464121302).
The spelling of 103010232111001 in words is "one hundred three trillion, ten billion, two hundred thirty-two million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •