Base | Representation |
---|---|
bin | 100111110110001111010001… |
… | …1101011111000011001000101 |
3 | 1200222000200021221110101122102 |
4 | 1033230132203223320121011 |
5 | 331420111341413022203 |
6 | 3241242243350041445 |
7 | 133553641555361252 |
oct | 11754364353703105 |
9 | 1628020257411572 |
10 | 350502142314053 |
11 | a175413a845294 |
12 | 333897b6349285 |
13 | 12076296a5a5c2 |
14 | 627a5739a6429 |
15 | 2a7c572226888 |
hex | 13ec7a3af8645 |
350502142314053 has 2 divisors, whose sum is σ = 350502142314054. Its totient is φ = 350502142314052.
The previous prime is 350502142314043. The next prime is 350502142314109. The reversal of 350502142314053 is 350413241205053.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 333522814436449 + 16979327877604 = 18262607^2 + 4120598^2 .
It is a cyclic number.
It is not a de Polignac number, because 350502142314053 - 248 = 69027165603397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 350502142313998 and 350502142314016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (350502142314043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 175251071157026 + 175251071157027.
It is an arithmetic number, because the mean of its divisors is an integer number (175251071157027).
Almost surely, 2350502142314053 is an apocalyptic number.
It is an amenable number.
350502142314053 is a deficient number, since it is larger than the sum of its proper divisors (1).
350502142314053 is an equidigital number, since it uses as much as digits as its factorization.
350502142314053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 38.
The spelling of 350502142314053 in words is "three hundred fifty trillion, five hundred two billion, one hundred forty-two million, three hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •