Base | Representation |
---|---|
bin | 1101110010001110100011… |
… | …10100011110011011111101 |
3 | 10222022220102100212101112212 |
4 | 12321013101310132123331 |
5 | 12433122214211332143 |
6 | 144245351541110205 |
7 | 6246022662034655 |
oct | 671072164363375 |
9 | 128286370771485 |
10 | 30313104402173 |
11 | 97277961a069a |
12 | 3496a713b8365 |
13 | 13bb68a164c88 |
14 | 76b23aa73365 |
15 | 3787a7b5d918 |
hex | 1b91d1d1e6fd |
30313104402173 has 2 divisors, whose sum is σ = 30313104402174. Its totient is φ = 30313104402172.
The previous prime is 30313104402083. The next prime is 30313104402193. The reversal of 30313104402173 is 37120440131303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29752682978404 + 560421423769 = 5454602^2 + 748613^2 .
It is a cyclic number.
It is not a de Polignac number, because 30313104402173 - 212 = 30313104398077 is a prime.
It is a super-2 number, since 2×303131044021732 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30313104402193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15156552201086 + 15156552201087.
It is an arithmetic number, because the mean of its divisors is an integer number (15156552201087).
Almost surely, 230313104402173 is an apocalyptic number.
It is an amenable number.
30313104402173 is a deficient number, since it is larger than the sum of its proper divisors (1).
30313104402173 is an equidigital number, since it uses as much as digits as its factorization.
30313104402173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 30313104402173 its reverse (37120440131303), we get a palindrome (67433544533476).
The spelling of 30313104402173 in words is "thirty trillion, three hundred thirteen billion, one hundred four million, four hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •