Base | Representation |
---|---|
bin | 10101000010110011010001… |
… | …011001011001011110000001 |
3 | 110010200211111221222222001201 |
4 | 111002303101121121132001 |
5 | 44112330401401442043 |
6 | 524501320240101201 |
7 | 25331423444121334 |
oct | 2502632131313601 |
9 | 403624457888051 |
10 | 92551468390273 |
11 | 27542948104872 |
12 | a469117604801 |
13 | 3c84748714c69 |
14 | 18bd72d11c61b |
15 | aa7721bd5c4d |
hex | 542cd1659781 |
92551468390273 has 2 divisors, whose sum is σ = 92551468390274. Its totient is φ = 92551468390272.
The previous prime is 92551468390243. The next prime is 92551468390291. The reversal of 92551468390273 is 37209386415529.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88406404491024 + 4145063899249 = 9402468^2 + 2035943^2 .
It is a cyclic number.
It is not a de Polignac number, because 92551468390273 - 245 = 57367096301441 is a prime.
It is not a weakly prime, because it can be changed into another prime (92551468390243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46275734195136 + 46275734195137.
It is an arithmetic number, because the mean of its divisors is an integer number (46275734195137).
It is a 2-persistent number, because it is pandigital, and so is 2⋅92551468390273 = 185102936780546, but 3⋅92551468390273 = 277654405170819 is not.
Almost surely, 292551468390273 is an apocalyptic number.
It is an amenable number.
92551468390273 is a deficient number, since it is larger than the sum of its proper divisors (1).
92551468390273 is an equidigital number, since it uses as much as digits as its factorization.
92551468390273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97977600, while the sum is 64.
The spelling of 92551468390273 in words is "ninety-two trillion, five hundred fifty-one billion, four hundred sixty-eight million, three hundred ninety thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •