Base | Representation |
---|---|
bin | 10111011100010011101001… |
… | …011110101110111101111011 |
3 | 111112001021221000112112210101 |
4 | 113130103221132232331323 |
5 | 102003143414400334321 |
6 | 1003135343551100231 |
7 | 30500515563310246 |
oct | 2734235136567573 |
9 | 445037830475711 |
10 | 103100312121211 |
11 | 2a93a662411269 |
12 | b691645b11677 |
13 | 456b419038592 |
14 | 1b661203b625d |
15 | bdbd20853791 |
hex | 5dc4e97aef7b |
103100312121211 has 2 divisors, whose sum is σ = 103100312121212. Its totient is φ = 103100312121210.
The previous prime is 103100312121143. The next prime is 103100312121221. The reversal of 103100312121211 is 112121213001301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103100312121211 - 223 = 103100303732603 is a prime.
It is a super-2 number, since 2×1031003121212112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103100312121221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51550156060605 + 51550156060606.
It is an arithmetic number, because the mean of its divisors is an integer number (51550156060606).
Almost surely, 2103100312121211 is an apocalyptic number.
103100312121211 is a deficient number, since it is larger than the sum of its proper divisors (1).
103100312121211 is an equidigital number, since it uses as much as digits as its factorization.
103100312121211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 103100312121211 its reverse (112121213001301), we get a palindrome (215221525122512).
The spelling of 103100312121211 in words is "one hundred three trillion, one hundred billion, three hundred twelve million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •