Base | Representation |
---|---|
bin | 101100000110000000001… |
… | …001100011110000100101 |
3 | 101201200020000100220201222 |
4 | 230012000021203300211 |
5 | 344121122043324333 |
6 | 10240002024230125 |
7 | 431626515316004 |
oct | 54060011436045 |
9 | 11650200326658 |
10 | 3030101933093 |
11 | a69071601634 |
12 | 40b30700b345 |
13 | 18c978064631 |
14 | a692cab6c3b |
15 | 53c472a5298 |
hex | 2c180263c25 |
3030101933093 has 2 divisors, whose sum is σ = 3030101933094. Its totient is φ = 3030101933092.
The previous prime is 3030101933051. The next prime is 3030101933113. The reversal of 3030101933093 is 3903391010303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2901322868929 + 128779064164 = 1703327^2 + 358858^2 .
It is an emirp because it is prime and its reverse (3903391010303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3030101933093 - 234 = 3012922063909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3030101933003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515050966546 + 1515050966547.
It is an arithmetic number, because the mean of its divisors is an integer number (1515050966547).
Almost surely, 23030101933093 is an apocalyptic number.
It is an amenable number.
3030101933093 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030101933093 is an equidigital number, since it uses as much as digits as its factorization.
3030101933093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19683, while the sum is 35.
Adding to 3030101933093 its reverse (3903391010303), we get a palindrome (6933492943396).
The spelling of 3030101933093 in words is "three trillion, thirty billion, one hundred one million, nine hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •