Base | Representation |
---|---|
bin | 100001100000001011001010… |
… | …110101011110101000100001 |
3 | 201022201012012111012002100222 |
4 | 201200023022311132220201 |
5 | 123303111214033321223 |
6 | 1241214023204452425 |
7 | 43015302616052564 |
oct | 4140131265365041 |
9 | 638635174162328 |
10 | 147346551073313 |
11 | 42a493598451a9 |
12 | 146388b99aa115 |
13 | 642a949210b07 |
14 | 285587acd04db |
15 | 1207c4e0700c8 |
hex | 8602cad5ea21 |
147346551073313 has 2 divisors, whose sum is σ = 147346551073314. Its totient is φ = 147346551073312.
The previous prime is 147346551073237. The next prime is 147346551073333. The reversal of 147346551073313 is 313370155643741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126147221214784 + 21199329858529 = 11231528^2 + 4604273^2 .
It is a cyclic number.
It is not a de Polignac number, because 147346551073313 - 234 = 147329371204129 is a prime.
It is a super-3 number, since 3×1473465510733133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (147346551073333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73673275536656 + 73673275536657.
It is an arithmetic number, because the mean of its divisors is an integer number (73673275536657).
Almost surely, 2147346551073313 is an apocalyptic number.
It is an amenable number.
147346551073313 is a deficient number, since it is larger than the sum of its proper divisors (1).
147346551073313 is an equidigital number, since it uses as much as digits as its factorization.
147346551073313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9525600, while the sum is 53.
The spelling of 147346551073313 in words is "one hundred forty-seven trillion, three hundred forty-six billion, five hundred fifty-one million, seventy-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •