Base | Representation |
---|---|
bin | 10101001001100111101000… |
… | …101110011000000111111101 |
3 | 110012100121220111221220001211 |
4 | 111021213220232120013331 |
5 | 44143014440331413041 |
6 | 525500445254404421 |
7 | 25410321410240002 |
oct | 2511475056300775 |
9 | 405317814856054 |
10 | 93020011201021 |
11 | 277036243293a3 |
12 | a523a99660711 |
13 | 3cb9998617688 |
14 | 18d829a5798a9 |
15 | ab49e5d00481 |
hex | 5499e8b981fd |
93020011201021 has 2 divisors, whose sum is σ = 93020011201022. Its totient is φ = 93020011201020.
The previous prime is 93020011200923. The next prime is 93020011201027. The reversal of 93020011201021 is 12010211002039.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68002618176900 + 25017393024121 = 8246370^2 + 5001739^2 .
It is an emirp because it is prime and its reverse (12010211002039) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 93020011201021 - 223 = 93020002812413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 93020011200983 and 93020011201001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (93020011201027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46510005600510 + 46510005600511.
It is an arithmetic number, because the mean of its divisors is an integer number (46510005600511).
Almost surely, 293020011201021 is an apocalyptic number.
It is an amenable number.
93020011201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
93020011201021 is an equidigital number, since it uses as much as digits as its factorization.
93020011201021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 93020011201021 in words is "ninety-three trillion, twenty billion, eleven million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •