Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101011111111000010100101 |
3 | 111021210001200222101112110021 |
4 | 113002203000223333002211 |
5 | 101240143021401444414 |
6 | 555302223355355141 |
7 | 30225600240625402 |
oct | 2702430053770245 |
9 | 437701628345407 |
10 | 101330101203109 |
11 | 2a317944505829 |
12 | b446551a52ab1 |
13 | 447050657a76c |
14 | 1b0459002b2a9 |
15 | baac6615ec24 |
hex | 5c28c0aff0a5 |
101330101203109 has 2 divisors, whose sum is σ = 101330101203110. Its totient is φ = 101330101203108.
The previous prime is 101330101203091. The next prime is 101330101203151. The reversal of 101330101203109 is 901302101033101.
Together with previous prime (101330101203091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86999924390625 + 14330176812484 = 9327375^2 + 3785522^2 .
It is a cyclic number.
It is not a de Polignac number, because 101330101203109 - 211 = 101330101201061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101330101243109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665050601554 + 50665050601555.
It is an arithmetic number, because the mean of its divisors is an integer number (50665050601555).
Almost surely, 2101330101203109 is an apocalyptic number.
It is an amenable number.
101330101203109 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330101203109 is an equidigital number, since it uses as much as digits as its factorization.
101330101203109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 101330101203109 in words is "one hundred one trillion, three hundred thirty billion, one hundred one million, two hundred three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •