Base | Representation |
---|---|
bin | 10101001101110101101110… |
… | …000000100000001100000001 |
3 | 110020101100110001002221011121 |
4 | 111031311232000200030001 |
5 | 44212242400043144301 |
6 | 530242005450112241 |
7 | 25440266015413363 |
oct | 2515655600401401 |
9 | 406340401087147 |
10 | 93310010131201 |
11 | 2780560a14a936 |
12 | a57013171b681 |
13 | 400b133472b96 |
14 | 190832b35ad33 |
15 | abc31a48e3a1 |
hex | 54dd6e020301 |
93310010131201 has 2 divisors, whose sum is σ = 93310010131202. Its totient is φ = 93310010131200.
The previous prime is 93310010131183. The next prime is 93310010131207. The reversal of 93310010131201 is 10213101001339.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92322292185601 + 987717945600 = 9608449^2 + 993840^2 .
It is an emirp because it is prime and its reverse (10213101001339) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 93310010131201 - 213 = 93310010123009 is a prime.
It is a super-2 number, since 2×933100101312012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (93310010131207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46655005065600 + 46655005065601.
It is an arithmetic number, because the mean of its divisors is an integer number (46655005065601).
Almost surely, 293310010131201 is an apocalyptic number.
It is an amenable number.
93310010131201 is a deficient number, since it is larger than the sum of its proper divisors (1).
93310010131201 is an equidigital number, since it uses as much as digits as its factorization.
93310010131201 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 93310010131201 in words is "ninety-three trillion, three hundred ten billion, ten million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •