Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101011111111000010010011 |
3 | 111021210001200222101112102121 |
4 | 113002203000223333002103 |
5 | 101240143021401444331 |
6 | 555302223355355111 |
7 | 30225600240625345 |
oct | 2702430053770223 |
9 | 437701628345377 |
10 | 101330101203091 |
11 | 2a317944505812 |
12 | b446551a52a97 |
13 | 447050657a757 |
14 | 1b0459002b295 |
15 | baac6615ec11 |
hex | 5c28c0aff093 |
101330101203091 has 2 divisors, whose sum is σ = 101330101203092. Its totient is φ = 101330101203090.
The previous prime is 101330101203073. The next prime is 101330101203109. The reversal of 101330101203091 is 190302101033101.
Together with next prime (101330101203109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (101330101203073) and next prime (101330101203109).
It is a cyclic number.
It is not a de Polignac number, because 101330101203091 - 27 = 101330101202963 is a prime.
It is not a weakly prime, because it can be changed into another prime (101330101203061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665050601545 + 50665050601546.
It is an arithmetic number, because the mean of its divisors is an integer number (50665050601546).
Almost surely, 2101330101203091 is an apocalyptic number.
101330101203091 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330101203091 is an equidigital number, since it uses as much as digits as its factorization.
101330101203091 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.
Adding to 101330101203091 its reverse (190302101033101), we get a palindrome (291632202236192).
The spelling of 101330101203091 in words is "one hundred one trillion, three hundred thirty billion, one hundred one million, two hundred three thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •