Base | Representation |
---|---|
bin | 110000111100101011… |
… | …0010111011000111101 |
3 | 101001022122122102102112 |
4 | 1201321112113120331 |
5 | 3210233432334323 |
6 | 120142245503405 |
7 | 10410564534224 |
oct | 1417126273075 |
9 | 331278572375 |
10 | 105115121213 |
11 | 40640822403 |
12 | 18456a11b65 |
13 | 9bb247769b |
14 | 513252bcbb |
15 | 2b03331178 |
hex | 187959763d |
105115121213 has 2 divisors, whose sum is σ = 105115121214. Its totient is φ = 105115121212.
The previous prime is 105115121207. The next prime is 105115121263. The reversal of 105115121213 is 312121511501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96918897124 + 8196224089 = 311318^2 + 90533^2 .
It is an emirp because it is prime and its reverse (312121511501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105115121213 - 24 = 105115121197 is a prime.
It is a super-2 number, since 2×1051151212132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105115121263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52557560606 + 52557560607.
It is an arithmetic number, because the mean of its divisors is an integer number (52557560607).
Almost surely, 2105115121213 is an apocalyptic number.
It is an amenable number.
105115121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
105115121213 is an equidigital number, since it uses as much as digits as its factorization.
105115121213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 105115121213 its reverse (312121511501), we get a palindrome (417236632714).
The spelling of 105115121213 in words is "one hundred five billion, one hundred fifteen million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •